A161113 Number of partitions of n into nonzero triangular numbers where every part appears at least 12 times.

0, 0, 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, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 2, 4, 3, 3, 5, 4, 4, 6, 5, 5, 7, 6, 6, 8, 7, 7, 9, 8, 8, 10, 9, 9, 12, 10, 10, 12, 11, 11, 14, 12, 12, 14, 13, 13, 17, 15, 15, 17, 16, 16, 20, 18, 18, 20, 19, 19, 23, 21, 21, 23, 22, 22, 26

Offset

1,36

Links

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

Crossrefs

Sequence in context: A161049 A138742 A161074 * A161048 A152830 A175409

Adjacent sequences: A161110 A161111 A161112 * A161114 A161115 A161116

Keyword

nonn

Author

R. H. Hardin, Jun 02 2009

Status

approved