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 A258302 #10 Sep 13 2016 13:16:31 %S A258302 1,1,9,271,16335,1525940,196284041,32409332818,6561153029810, %T A258302 1577073620254149,439541281384464800,139493983910450106067, %U A258302 49695878602452933374813,19646816226938989587513067,8537966749269377751401117583,4046350906270352192325991177139 %N A258302 Number of partitions of 2*n^3 into parts that are at most n. %H A258302 Vaclav Kotesovec, <a href="/A258302/b258302.txt">Table of n, a(n) for n = 0..114</a> %F A258302 a(n) ~ exp(2*n + 1/8) * 2^(n-1) * n^(n-3) / (2*Pi). %p A258302 T:=proc(n,k) option remember; `if`(n=0 or k=1, 1, T(n,k-1) + `if`(n<k, 0, T(n-k,k))) end proc: seq(T(2*n^3, n), n=0..20); %Y A258302 Cf. A238608, A258303, A258304, A258305. %K A258302 nonn %O A258302 0,3 %A A258302 _Vaclav Kotesovec_, May 25 2015