OFFSET
0,4
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..27
A. V. Sills and D. Zeilberger, Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz), arXiv:1108.4391 [math.CO], 2011.
FORMULA
a(n) = [x^(n^n-n*(n+1)/2)] Product_{j=1..n} 1/(1-x^j).
a(n) ~ n^(n*(n-1)) / (n!*(n-1)!) ~ exp(2*n) * n^(n*(n-3)) / (2*Pi). - Vaclav Kotesovec, Jun 05 2015
EXAMPLE
a(1) = 1: 1.
a(2) = 1: 211.
a(3) = 48: 3333333321, ..., 321111111111111111111111.
MATHEMATICA
maxExponent = 50; a[0] = 0; a[1] = 1;
a[n_] := Module[{}, aparts = List @@ (Product[1/(1 - x^j), {j, 1, n}] // Apart); cc = aparts + O[x]^maxExponent // CoefficientList[#, x]&; f[k_] = Total[FindSequenceFunction[#, k]& /@ cc]; f[n^n-n(n+1)/2 + 1] // Round];
Table[an = a[n]; Print[n, " ", an]; an, {n, 0, 9}] (* Jean-François Alcover, Nov 15 2018 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Feb 16 2014
STATUS
approved