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.

A238566 Number of partitions of 9^n into parts that are at most n.

This page as a plain text file.
%I A238566 #6 Jun 05 2015 16:59:40
%S A238566 0,1,41,44652,1965803130,4223556692359571,490686876939553950148311,
%T A238566 3299362171812031624458362654344896,
%U A238566 1347816410652573760215295879527613786555869189,34687845413783594101366282545316028561007822069601179170488
%N A238566 Number of partitions of 9^n into parts that are at most n.
%H A238566 Alois P. Heinz, <a href="/A238566/b238566.txt">Table of n, a(n) for n = 0..34</a>
%F A238566 a(n) = [x^(9^n)] Product_{j=1..n} 1/(1-x^j).
%F A238566 a(n) ~ 9^(n*(n-1)) / (n!*(n-1)!). - _Vaclav Kotesovec_, Jun 05 2015
%Y A238566 Column k=9 of A238010.
%K A238566 nonn
%O A238566 0,3
%A A238566 _Alois P. Heinz_, Feb 28 2014