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.

This page as a plain text file.
%I A238560 #10 Jun 05 2015 16:55:36
%S A238560 0,1,5,75,4410,1366617,2559274110,31328639384771,2625213100478051111,
%T A238560 1553872467564223628517240,6655897240266476140036201639917,
%U A238560 210488414263886836416720847147423569801,49987740079047684574220644720678455290986424137
%N A238560 Number of partitions of 3^n into parts that are at most n.
%H A238560 Alois P. Heinz, <a href="/A238560/b238560.txt">Table of n, a(n) for n = 0..45</a>
%F A238560 a(n) = [x^(3^n)] Product_{j=1..n} 1/(1-x^j).
%F A238560 a(n) ~ 3^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%e A238560 a(2) = 5: 22221, 222111, 2211111, 21111111, 111111111.
%Y A238560 Column k=3 of A238010.
%K A238560 nonn
%O A238560 0,3
%A A238560 _Alois P. Heinz_, Feb 28 2014