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.

A238560 Number of partitions of 3^n into parts that are at most n.

Original entry on oeis.org

0, 1, 5, 75, 4410, 1366617, 2559274110, 31328639384771, 2625213100478051111, 1553872467564223628517240, 6655897240266476140036201639917, 210488414263886836416720847147423569801, 49987740079047684574220644720678455290986424137
Offset: 0

Views

Author

Alois P. Heinz, Feb 28 2014

Keywords

Examples

			a(2) = 5: 22221, 222111, 2211111, 21111111, 111111111.
		

Crossrefs

Column k=3 of A238010.

Formula

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