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.
%I A238615 #9 May 25 2015 10:40:47
%S A238615 1,1,513,290594892,8006513870533064,3157977415776418319210477,
%T A238615 9355115500676554620340590943203672,
%U A238615 139997247522791157386395916200494707946968395,8097446373533819684208223226876398545717123633973546819
%N A238615 Number of partitions of n^10 into parts that are at most n.
%C A238615 In general, for m > 3, is "Number of partitions of n^m into parts that are at most n" asymptotic to exp(2*n) * n^((m-2)*n-m) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%H A238615 Alois P. Heinz, <a href="/A238615/b238615.txt">Table of n, a(n) for n = 0..60</a>
%F A238615 a(n) = [x^(n^10)] Product_{j=1..n} 1/(1-x^j).
%F A238615 a(n) ~ exp(2*n) * n^(8*n-10) / (2*Pi). - _Vaclav Kotesovec_, May 25 2015
%Y A238615 Column k=10 of A238016.
%K A238615 nonn
%O A238615 0,3
%A A238615 _Alois P. Heinz_, Mar 01 2014