id:A053216 - OEIS Search Results

Search: id:A053216

Displaying 1-1 of 1 results found.

page 1

Number of integers that can be partitioned into squares in n different ways, or the number of times n occurs in A001156.

+0
2

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

	OFFSET	`1,1`
	CROSSREFS	`Cf. A001156, A053217, A000290, A002828.` `Sequence in context: A128433 A089746 A094884 this_sequence A095813 A138522 A010656` `Adjacent sequences: A053213 A053214 A053215 this_sequence A053217 A053218 A053219`
	KEYWORD	`nonn,easy`
	AUTHOR	`Asher Auel (asher.auel(AT)reed.edu) Dec 27, 1999`

page 1

Search completed in 0.005 seconds

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

AT&T Labs Research