login
Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of x.
3

%I #25 Feb 28 2018 08:47:48

%S 1,27,27,91,151,225,31,67,14037,47,119,4177,165,103,3599,291,11467887,

%T 3089,1297,379,57,131,110311,153,2637,353,163,1679,1211,995,54863,105,

%U 43,615,439,15,12955,2263,11661,1867,1281,1433,46671,303,21139,324545,4159,343803

%N Sequence A001033 gives the numbers n such that the sum of the squares of n consecutive odd numbers x^2 + (x+2)^2 + ... +(x+2n-2)^2 = k^2 for some integer k. For each n, this sequence gives the least value of x.

%H Christopher E. Thompson, <a href="/A056131/b056131.txt">Table of n, a(n) for n = 1..7103</a> (extends first 100 terms computed by T. D. Noe).

%e 995 is a term because the sum of the squares of 400 consecutive odd numbers beginning with 995 is 28260^2.

%Y Cf. A001033, A056132.

%K nonn

%O 1,2

%A _Robert G. Wilson v_, Aug 04 2000

%E Corrected and extended by _T. D. Noe_, Oct 24 2007

%E Term corresponding to 1024 in A001033 was missing from b-file. _Christopher E. Thompson_, Feb 05 2016