id:A161092 - OEIS Search Results

Search: id:A161092

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 2, 4, 3, 3, 3, 5, 4, 4, 4, 6, 5, 5, 5, 8, 6, 6, 6, 9, 8, 8, 8, 10, 10, 9, 9, 11, 11, 11, 11, 14, 12, 13, 12, 16, 14, 15, 15, 19, 18, 17, 18, 22, 21, 20, 21, 26, 26, 26, 25, 30, 29, 30, 29, 34, 34, 35, 35, 40, 39, 39, 40, 46, 46, 47, 48, 54 (list; graph; listen)

	OFFSET	`1,16`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A126805 A110963 A106348 this_sequence A029332 A134431 A070879` `Adjacent sequences: A161089 A161090 A161091 this_sequence A161093 A161094 A161095`
	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