id:A161096 - OEIS Search Results

Search: id:A161096

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into squares where every part appears at least 8 times

+0
1

0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 2, 4, 3, 3, 3, 5, 4, 4, 4, 6, 5, 5, 5, 7, 6, 6, 6, 8, 7, 7, 7, 9, 8, 8, 8, 10, 9, 9, 9, 12, 10, 10, 10, 12, 11, 11, 11, 14, 14, 13, 13, 15, 14, 14, 14, 16, 16, 17, 16, 18, 17, 17, 17, 19, 18, 19, 20 (list; graph; listen)

	OFFSET	`1,32`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A161097 A105240 A143654 this_sequence A165983 A083894 A128257` `Adjacent sequences: A161093 A161094 A161095 this_sequence A161097 A161098 A161099`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 02 2009`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research