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

A347577
Number of partitions of n into 10 or more distinct parts.
5
1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 76, 99, 131, 169, 219, 278, 355, 445, 560, 695, 863, 1061, 1304, 1588, 1933, 2336, 2819, 3381, 4050, 4824, 5738, 6793, 8028, 9450, 11105, 13000, 15195, 17702, 20588, 23874, 27640, 31913, 36790, 42308, 48578, 55654, 63666
OFFSET
55,3
FORMULA
G.f.: Sum_{k>=10} x^(k*(k + 1)/2) / Product_{j=1..k} (1 - x^j).
MATHEMATICA
nmax = 103; CoefficientList[Series[Sum[x^(k (k + 1)/2)/Product[(1 - x^j), {j, 1, k}], {k, 10, nmax}], {x, 0, nmax}], x] // Drop[#, 55] &
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Sep 07 2021
STATUS
approved