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 A177448 #2 Mar 30 2012 18:37:21
%S A177448 1,1,2,13,166,3324,92718,3354712,150206430,8050991676,504049958320,
%T A177448 36172232930282,2931474921768206,265078092222575572,
%U A177448 26480336590135734816,2898139377307388441520,345055687960080723910286
%N A177448 G.f.: Sum_{n>=0} a(n)*x^n/(1+x)^(2*n^2) = 1+x.
%F A177448 a(n) = number of subpartitions of the partition [0,1,6,15,28,...,2(n-1)^2-(n-1)] for n>0 with a(0)=1. See A115728 for the definition of subpartitions.
%e A177448 1+x = 1 + 1*x/(1+x)^2 + 2*x^2/(1+x)^8 + 13*x^3/(1+x)^18 + 166*x^4/(1+x)^32 + 3324*x^5/(1+x)^50 + 92718*x^6/(1+x)^72 +...
%o A177448 (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^(2*k^2)),n)}
%Y A177448 Cf. A177447, A177449, A177450.
%K A177448 nonn
%O A177448 0,3
%A A177448 _Paul D. Hanna_, May 09 2010