id:A056131 - OEIS Search Results

Search: id:A056131

Displaying 1-1 of 1 results found.

page 1

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.

+0
2

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; listen)

	OFFSET	`1,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..100`
	EXAMPLE	`995 is a term because the sum of the squares of 400 consecutive odd numbers beginning with 995 is 28260^2.`
	CROSSREFS	`Sequence in context: A010866 A040703 A022361 this_sequence A031957 A106126 A069551` `Adjacent sequences: A056128 A056129 A056130 this_sequence A056132 A056133 A056134`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 04 2000`
	EXTENSIONS	`Corrected and extended by T. D. Noe (noe(AT)sspectra.com), Oct 24 2007`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research