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 A177449 #2 Mar 30 2012 18:37:21
%S A177449 1,1,3,30,586,17865,756285,41440056,2805638310,227131872654,
%T A177449 21459076173105,2322336372705030,283667666439112350,
%U A177449 38643426990067599005,5813534115429573742587,957883907138024944675200
%N A177449 G.f.: Sum_{n>=0} a(n)*x^n/(1+x)^(3*n^2) = 1+x.
%F A177449 a(n) = number of subpartitions of the partition [0,2,10,24,44,...,3(n-1)^2-(n-1)] for n>0 with a(0)=1. See A115728 for the definition of subpartitions.
%e A177449 1+x = 1 + 1*x/(1+x)^3 + 3*x^2/(1+x)^12 + 30*x^3/(1+x)^27 + 586*x^4/(1+x)^48 + 17865*x^5/(1+x)^75 + 756285*x^6/(1+x)^108 +...
%o A177449 (PARI) {a(n)=local(F=1/(1+x+x*O(x^n)));polcoeff(1+x-sum(k=0,n-1,a(k)*x^k*F^(3*k^2)),n)}
%Y A177449 Cf. A177447, A177448, A177450.
%K A177449 nonn
%O A177449 0,3
%A A177449 _Paul D. Hanna_, May 09 2010