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.

A238610 Number of partitions of n^5 into parts that are at most n.

This page as a plain text file.
%I A238610 #8 May 25 2015 10:14:30
%S A238610 1,1,17,5043,7566280,33432635477,331281477244572,6242342067484101895,
%T A238610 200386212932492140762672,10133053906998476170548376403,
%U A238610 761287353202857218355451068558296,81209207250425252838671771562105020103,11863819168025774694177783984734986151951164
%N A238610 Number of partitions of n^5 into parts that are at most n.
%H A238610 Alois P. Heinz, <a href="/A238610/b238610.txt">Table of n, a(n) for n = 0..60</a>
%F A238610 a(n) = [x^(n^5)] Product_{j=1..n} 1/(1-x^j).
%F A238610 a(n) ~ exp(2*n) * n^(3*n-5) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%Y A238610 Column k=5 of A238016.
%K A238610 nonn
%O A238610 0,3
%A A238610 _Alois P. Heinz_, Mar 01 2014