|
%I #22 Feb 28 2018 08:45:14
%S 1,172,265,715,1407,2002,808,1241,139195,1570,2739,52614,4511,3953,
%T 52689,6986,178033207,52094,24485,10416,6118,7667,1889970,8283,52271,
%U 13143,10697,40934,32095,28260,1117797,13253,12987,24926,23276,14329
%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 k.
%H Christopher E. Thompson, <a href="/A056132/b056132.txt">Table of n, a(n) for n = 1..7103</a> (extends first 100 terms computed by T. D. Noe).
%Y Cf. A001033, A056131.
%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
|
