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

A161265
Number of partitions of n into central polygonal numbers A000124 where every part appears at least 12 times
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 8, 7, 10, 8, 10, 9, 12, 10, 12, 11, 14, 12, 14, 13, 17, 15, 17, 16, 20, 18, 20, 19, 23, 21, 23, 22, 27, 24, 27, 25, 31, 27, 31, 28, 35, 30, 35, 31, 41, 34, 41, 36, 47, 40, 49, 44, 56, 48, 59, 52
OFFSET
1,24
LINKS
CROSSREFS
Sequence in context: A336312 A161237 A161061 * A161290 A185218 A363827
KEYWORD
nonn
AUTHOR
R. H. Hardin Jun 06 2009
STATUS
approved