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.

A238609 Number of partitions of n^4 into parts that are at most n.

Original entry on oeis.org

1, 1, 9, 588, 123464, 55567352, 44056912182, 54667189410224, 98149884074667116, 241192889005578902877, 778400276435728381405745, 3195674736701993615997749350, 16272552341081798500863569890566, 100683204917037438858515986247835992
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Column k=4 of A238016.

Formula

a(n) = [x^(n^4)] Product_{j=1..n} 1/(1-x^j).
a(n) ~ exp(2*n) * n^(2*n-4) / (2*Pi). - Vaclav Kotesovec, May 25 2015