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”).

A161106
Number of partitions of n into nonzero triangular numbers where every part appears at least 5 times
1
0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 7, 5, 6, 7, 6, 8, 10, 8, 9, 10, 9, 11, 13, 11, 12, 14, 12, 14, 17, 14, 17, 19, 16, 19, 23, 20, 23, 27, 23, 27, 33, 27, 31, 36, 31, 38, 43, 37, 43, 48, 44, 50, 56, 50, 57, 66, 58, 66, 74, 66, 78, 84, 76, 86, 95, 89, 99
OFFSET
1,15
LINKS
CROSSREFS
Sequence in context: A356606 A099386 A161067 * A161041 A153907 A029306
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 02 2009
STATUS
approved