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

A039869
Number of partitions satisfying cn(2,5) + cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).
0
1, 1, 1, 3, 5, 6, 8, 12, 18, 26, 33, 45, 62, 82, 107, 140, 184, 239, 304, 388, 494, 631, 793, 989, 1236, 1544, 1918, 2372, 2915, 3582, 4393, 5372, 6540, 7943, 9624, 11648, 14055, 16916, 20310, 24357, 29143, 34796, 41461, 49336, 58597
OFFSET
1,4
COMMENTS
For a given partition cn(i,n) means the number of its parts equal to i modulo n.
Short: 2 + 3 < 0 + 1 + 4 (BBpMZAAp).
CROSSREFS
Sequence in context: A089085 A033163 A228372 * A076210 A039014 A102989
KEYWORD
nonn
STATUS
approved