A161109 Number of partitions of n into nonzero triangular numbers where every part appears at least 8 times

0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 6, 5, 6, 7, 6, 7, 9, 7, 8, 9, 8, 9, 11, 9, 11, 12, 11, 12, 14, 12, 14, 15, 14, 15, 17, 15, 17, 18, 17, 18, 21, 18, 20, 22, 20, 21, 25, 21, 25, 27, 24, 26, 31, 26, 30, 34, 31, 34, 41, 34, 39, 44, 39

Offset

1,24

Links

R. H. Hardin, Table of n, a(n) for n=1..1000

Crossrefs

Sequence in context: A255274 A025431 A161070 * A161044 A029325 A276417

Adjacent sequences: A161106 A161107 A161108 * A161110 A161111 A161112

Keyword

nonn

Author

R. H. Hardin Jun 02 2009

Status

approved