id:A062862 - OEIS Search Results

Search: id:A062862

Displaying 1-1 of 1 results found.

page 1

Number of ways n can be written as the sum of squares of consecutive numbers (possibly including squares of negative numbers).

+0
3

1, 4, 1, 0, 2, 4, 2, 0, 0, 2, 1, 0, 0, 2, 4, 2, 2, 0, 0, 2, 0, 0, 0, 0, 0, 4, 0, 0, 1, 2, 4, 2, 0, 0, 0, 2, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 2, 0, 0, 0, 2, 4, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 4, 2, 0, 0, 0, 2, 4, 2, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0 (list; graph; listen)

	OFFSET	`0,2`
	LINKS	`Index entries for sequences related to sums of squares`
	EXAMPLE	`a(25)=4 since 25 = 5^2 = 3^2+4^2 = (-4)^2+(-3)^2 = (-5)^2.`
	CROSSREFS	`If a(n) is zero then n is in A062863, otherwise in A062861. If a(n) is odd then n is in A006331.` `Sequence in context: A058710 A124539 A096501 this_sequence A084119 A122899 A021713` `Adjacent sequences: A062859 A062860 A062861 this_sequence A062863 A062864 A062865`
	KEYWORD	`nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Jun 25 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research