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.

A238609 Number of partitions of n^4 into parts that are at most n.

This page as a plain text file.
%I A238609 #8 May 25 2015 10:02:35
%S A238609 1,1,9,588,123464,55567352,44056912182,54667189410224,
%T A238609 98149884074667116,241192889005578902877,778400276435728381405745,
%U A238609 3195674736701993615997749350,16272552341081798500863569890566,100683204917037438858515986247835992
%N A238609 Number of partitions of n^4 into parts that are at most n.
%H A238609 Alois P. Heinz, <a href="/A238609/b238609.txt">Table of n, a(n) for n = 0..70</a>
%F A238609 a(n) = [x^(n^4)] Product_{j=1..n} 1/(1-x^j).
%F A238609 a(n) ~ exp(2*n) * n^(2*n-4) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%Y A238609 Column k=4 of A238016.
%K A238609 nonn
%O A238609 0,3
%A A238609 _Alois P. Heinz_, Mar 01 2014