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 A258293 #12 Jun 11 2015 05:12:57
%S A258293 1,1,7,75,1033,16019,269005,4767088,87914929,1671580383,32560379840,
%T A258293 646795901962,13058489343812,267268692575830,5534279506641422,
%U A258293 115754904055926892,2442438538492842691,51934447672016653655,1111872048730513043539,23949840661000275507964
%N A258293 Number of partitions of 3*n^2 into parts that are at most n.
%H A258293 Vaclav Kotesovec, <a href="/A258293/b258293.txt">Table of n, a(n) for n = 0..274</a>
%F A258293 a(n) ~ c * d^n / n^2, where d = 23.98280768122086592445663786762351573848..., c = 0.0530017980244665552354063060738409813... .
%p A258293 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(3*n^2, n), n=0..20);
%t A258293 (* A program to compute the constant d = 23.98280768... *) With[{j=3}, r^(2*j+1)/(r-1) /.FindRoot[-PolyLog[2,1-r] == (j+1/2)*Log[r]^2, {r, E}, WorkingPrecision->100]] (* _Vaclav Kotesovec_, Jun 10 2015 *)
%Y A258293 Cf. A206226, A258296, A258294, A258295.
%K A258293 nonn
%O A258293 0,3
%A A258293 _Vaclav Kotesovec_, May 25 2015