cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A347606 Number of partitions of n^n into exactly n parts.

Original entry on oeis.org

0, 1, 2, 61, 117874, 33219689231, 2559960025059106420, 85975912953927216830024650654, 1841153609473379088124269084031755459049386
Offset: 0

Views

Author

Seiichi Manyama, Sep 08 2021

Keywords

Crossrefs

Programs

  • PARI
    a(n) = polcoef(prod(k=1, n, 1/(1-x^k+x*O(x^(n^n-n)))), n^n-n);

Formula

a(n) = [x^(n^n-n)] Product_{k=1..n} 1/(1-x^k).