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.

A238610 Number of partitions of n^5 into parts that are at most n.

Original entry on oeis.org

1, 1, 17, 5043, 7566280, 33432635477, 331281477244572, 6242342067484101895, 200386212932492140762672, 10133053906998476170548376403, 761287353202857218355451068558296, 81209207250425252838671771562105020103, 11863819168025774694177783984734986151951164
Offset: 0

Views

Author

Alois P. Heinz, Mar 01 2014

Keywords

Crossrefs

Column k=5 of A238016.

Formula

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