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.

A238565 Number of partitions of 8^n into parts that are at most n.

Original entry on oeis.org

0, 1, 33, 22102, 478968264, 400686586344699, 14330879421541116923943, 23444113544017670689348160755868, 1841159754991692001851990839259642586671980, 7197738918090981779157236361118960948634130123398244711
Offset: 0

Views

Author

Alois P. Heinz, Feb 28 2014

Keywords

Crossrefs

Column k=8 of A238010.

Formula

a(n) = [x^(8^n)] Product_{j=1..n} 1/(1-x^j).
a(n) ~ 8^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015