id:A161098 - OEIS Search Results

Search: id:A161098

Displaying 1-1 of 1 results found.

page 1

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

+0
1

0, 0, 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, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 3, 4, 3, 4, 4, 5, 4, 5, 5, 6, 5, 6, 6, 7, 6, 7, 7, 8, 7, 8, 8, 9, 8, 9, 9, 10, 9, 10, 10, 11, 10, 11, 11, 12, 11, 13, 12, 13, 12, 13, 13, 14, 13, 14, 15, 16, 15, 16, 16 (list; graph; listen)

	OFFSET	`1,40`
	LINKS	`Ron Hardin, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Sequence in context: A050330 A076398 A086257 this_sequence A136177 A066922 A033183` `Adjacent sequences: A161095 A161096 A161097 this_sequence A161099 A161100 A161101`
	KEYWORD	`nonn`
	AUTHOR	`Ron Hardin (rhhardin(AT)att.net) Jun 02 2009`

page 1

Search completed in 0.002 seconds

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.

AT&T Labs Research