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

A347606
Number of partitions of n^n into exactly n parts.
2
0, 1, 2, 61, 117874, 33219689231, 2559960025059106420, 85975912953927216830024650654, 1841153609473379088124269084031755459049386
OFFSET
0,3
FORMULA
a(n) = [x^(n^n-n)] Product_{k=1..n} 1/(1-x^k).
PROG
(PARI) a(n) = polcoef(prod(k=1, n, 1/(1-x^k+x*O(x^(n^n-n)))), n^n-n);
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Seiichi Manyama, Sep 08 2021
STATUS
approved