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

A039873
Number of partitions satisfying cn(2,5) < cn(0,5) + cn(1,5) + cn(4,5) and cn(3,5) < cn(0,5) + cn(1,5) + cn(4,5).
0
1, 1, 1, 3, 5, 6, 9, 12, 18, 28, 35, 48, 66, 86, 117, 152, 198, 257, 330, 427, 541, 688, 868, 1086, 1369, 1705, 2114, 2623, 3232, 3983, 4892, 5972, 7287, 8868, 10761, 13041, 15736, 18958, 22802, 27368, 32793, 39162, 46712, 55640, 66130
OFFSET
1,4
COMMENTS
For a given partition cn(i,n) means the number of its parts equal to i modulo n.
Short: 2 < 0 + 1 + 4 and 3 < 0 + 1 + 4 (BBMZAAp).
CROSSREFS
Sequence in context: A236343 A325420 A168063 * A096394 A075472 A072522
KEYWORD
nonn
STATUS
approved