A161114 Number of partitions of n into nonzero triangular numbers where every part appears at least 13 times

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

Offset

1,39

Links

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

Crossrefs

Sequence in context: A161115 A161050 A161075 * A161049 A138742 A161074

Adjacent sequences: A161111 A161112 A161113 * A161115 A161116 A161117

Keyword

nonn

Author

R. H. Hardin Jun 02 2009

Status

approved