The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056131 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
 1, 27, 27, 91, 151, 225, 31, 67, 14037, 47, 119, 4177, 165, 103, 3599, 291, 11467887, 3089, 1297, 379, 57, 131, 110311, 153, 2637, 353, 163, 1679, 1211, 995, 54863, 105, 43, 615, 439, 15, 12955, 2263, 11661, 1867, 1281, 1433, 46671, 303, 21139, 324545, 4159, 343803 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Christopher E. Thompson, Table of n, a(n) for n = 1..7103 (extends first 100 terms computed by T. D. Noe). EXAMPLE 995 is a term because the sum of the squares of 400 consecutive odd numbers beginning with 995 is 28260^2. CROSSREFS Cf. A001033, A056132. Sequence in context: A040703 A022361 A238370 * A253102 A165848 A031957 Adjacent sequences:  A056128 A056129 A056130 * A056132 A056133 A056134 KEYWORD nonn AUTHOR Robert G. Wilson v, Aug 04 2000 EXTENSIONS Corrected and extended by T. D. Noe, Oct 24 2007 Term corresponding to 1024 in A001033 was missing from b-file. Christopher E. Thompson, Feb 05 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 29 14:54 EDT 2020. Contains 333107 sequences. (Running on oeis4.)