login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A161094
Number of partitions of n into squares where every part appears at least 6 times
1
0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 9, 8, 9, 8, 9, 9, 11, 10, 11, 12, 12, 11, 12, 12, 13, 13, 14, 14, 16, 14, 15, 15, 16, 15, 18, 17, 18, 18, 19, 18, 20, 19, 21, 22, 23, 22, 25, 24, 25, 25, 27
OFFSET
1,24
LINKS
CROSSREFS
Sequence in context: A050119 A290253 A097637 * A307343 A340034 A331310
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 02 2009
STATUS
approved