OFFSET
0,3
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..10000
Igor Pak, Complexity problems in enumerative combinatorics, arXiv:1803.06636 [math.CO], 2018.
FORMULA
G.f.: 1/Product_{k>=1} (1-q^A000041(k)). - Michel Marcus, Jun 20 2018
MAPLE
with(combinat): gf := 1/product((1-q^numbpart(k)), k=1..20): s := series(gf, q, 200): for i from 0 to 199 do printf(`%d, `, coeff(s, q, i)) od: # James A. Sellers, Feb 08 2002
MATHEMATICA
CoefficientList[ Series[1/Product[1 - x^PartitionsP[i], {i, 1, 15}], {x, 0, 50}], x]
PROG
(PARI) seq(n)={my(t=1); while(numbpart(t+1)<=n, t++); Vec(1/prod(k=1, t, 1-x^numbpart(k) + O(x*x^n)))} \\ Andrew Howroyd, Jun 22 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from James A. Sellers, Feb 08 2002
a(0)=1 prepended by Alois P. Heinz, Jul 02 2017
STATUS
approved