olymmath

NL-NWO 2009 Problem 2

    Consider the sequence of integers 0,1,2,4,6,9,12,...0, 1, 2, 4, 6, 9, 12,... obtained by starting with zero, adding 11 , then adding 11 again, then adding 22 , and adding 22 again, then adding 33 , and adding 33 again, and so on. If we call the subsequent terms of this sequence a0,a1,a2,...a_0, a_1, a_2, ... , then we have a0=0a_0 = 0 , and a2n−1=a2n−2+na_{2n-1} = a_{2n-2} + n , a2n=a2n−1+na_{2n} = a_{2n-1} + n for all integers n≥1n \ge 1 . Find all integers k≥0k \ge 0 for which aka_k is the square of an integer.

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator nl-nwo/2009/p2 · Tag JC6NMW372R · Edit this page on GitHub · Keys: j next, k previous