[go: up one dir, main page]

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

A039853
Number of partitions satisfying cn(0,5) + cn(2,5) + cn(3,5) <= 1.
0
1, 2, 3, 4, 5, 7, 9, 12, 15, 18, 23, 29, 35, 43, 51, 62, 74, 89, 105, 124, 146, 172, 201, 235, 272, 316, 366, 423, 486, 559, 640, 734, 838, 955, 1086, 1235, 1400, 1587, 1793, 2025, 2282, 2572, 2891, 3248, 3642
OFFSET
1,2
COMMENTS
For a given partition cn(i,n) means the number of its parts equal to i modulo n.
Short: 0 + 2 + 3 <= u (ZBBpU).
CROSSREFS
Sequence in context: A190269 A304632 A306385 * A062188 A122129 A280909
KEYWORD
nonn
STATUS
approved