id:A000164 - OEIS Search Results

Search: id:A000164

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into 3 squares.

+0
2

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

	OFFSET	`0,10`
	REFERENCES	`E. Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 84.`
	LINKS	`T. D. Noe, Table of n, a(n) for n = 0..10000`
	CROSSREFS	`Sequence in context: A090405 A079635 A037909 this_sequence A157746 A037820 A076493` `Adjacent sequences: A000161 A000162 A000163 this_sequence A000165 A000166 A000167`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research