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

A039888
Number of partitions satisfying cn(1,5) < cn(2,5) + cn(3,5) and cn(4,5) < cn(2,5) + cn(3,5).
0
0, 1, 1, 1, 2, 3, 5, 7, 9, 15, 18, 25, 33, 47, 66, 81, 102, 135, 180, 240, 291, 363, 462, 599, 761, 929, 1138, 1421, 1780, 2214, 2679, 3261, 3989, 4902, 5970, 7195, 8666, 10475, 12642, 15202, 18172, 21736, 25954, 30961, 36803
OFFSET
1,5
COMMENTS
For a given partition cn(i,n) means the number of its parts equal to i modulo n.
Short: 1 < 2 + 3 and 4 < 2 + 3 (AAMBBp).
CROSSREFS
Sequence in context: A325833 A143587 A096305 * A036959 A108031 A280429
KEYWORD
nonn
STATUS
approved