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

A161266
Number of partitions of n into central polygonal numbers A000124 where every part appears at least 13 times
1
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, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 10, 9, 10, 10, 12, 11, 12, 12, 14, 13, 14, 14, 16, 16, 17, 17, 19, 19, 20, 20, 22, 22, 23, 23, 25, 25, 27, 26, 29, 28, 31, 29, 33, 31, 35, 32, 37, 34, 39, 37, 42, 39, 45, 42, 49
OFFSET
1,26
LINKS
CROSSREFS
Sequence in context: A334948 A161238 A161062 * A161291 A175834 A161318
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 06 2009
STATUS
approved