Prove that for every nāN there exists exactly one sequence of 2n+1 consecutive numbers, such that the sum of the squares of the first n+1 numbers is equal to the sum of the squares of the last n numbers. Also express the smallest number of that sequence in terms of n. consecutivenumber theorycombinatorics