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.

A347605 Number of partitions of n^n into n or more parts.

Original entry on oeis.org

1, 1, 4, 2996, 365749566865192, 8630901377559029573671524821295260243701883575513285157821
Offset: 0

Views

Author

Seiichi Manyama, Sep 08 2021

Keywords

Comments

The next term is too large to include.

Crossrefs

Formula

a(n) = [x^(n^n)] Sum_{k>=n} x^k / Product_{j=1..k} (1 - x^j).
a(n) = A347607(n) + A347606(n) - A238000(n).