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

A347626
Number of partitions of n^n into distinct odd parts.
3
1, 1, 1, 14, 2824974, 7375247711025022789604527681
OFFSET
0,4
COMMENTS
The next term a(6) = 1.46058224...*10^116 is too large to include.
LINKS
FORMULA
a(n) = [x^(n^n)] Product_{k>=0} (1 + x^(2*k+1)).
a(n) = A000700(n^n).
PROG
(PARI) a(n) = polcoef(prod(k=0, n^n\2, 1+x^(2*k+1)+x*O(x^(n^n))), n^n);
CROSSREFS
Main diagonal of A347630.
Sequence in context: A013800 A368692 A350891 * A013870 A195898 A263500
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Sep 09 2021
STATUS
approved