id:A056132 - OEIS Search Results

Search: id:A056132

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 k.

+0
2

1, 172, 265, 715, 1407, 2002, 808, 1241, 139195, 1570, 2739, 52614, 4511, 3953, 52689, 6986, 178033207, 52094, 24485, 10416, 6118, 7667, 1889970, 8283, 52271, 13143, 10697, 40934, 32095, 28260, 1117797, 13253, 12987, 24926, 23276, 14329 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..100`
	CROSSREFS	`Sequence in context: A015356 A146339 A067356 this_sequence A043387 A035828 A097845` `Adjacent sequences: A056129 A056130 A056131 this_sequence A056133 A056134 A056135`
	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 November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research