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 A212028 #5 Apr 27 2012 01:22:35 %S A212028 1,1,2,11,74,635,6296,70268,864106,11546531,165996792,2548556963, %T A212028 41546769324,715850868468,12986529841038,247255748839532, %U A212028 4926870211273246,102495266879754087,2221254395951869988,50049980203162990978,1170440788530570387644 %N A212028 G.f. satisfies: A(x) = 1 + x*A(x*A(x)^3)^2. %e A212028 G.f.: A(x) = 1 + x + 2*x^2 + 11*x^3 + 74*x^4 + 635*x^5 + 6296*x^6 +... %e A212028 Related expansions: %e A212028 A(x)^2 = 1 + 2*x + 5*x^2 + 26*x^3 + 174*x^4 + 1462*x^5 + 14279*x^6 +... %e A212028 A(x)^3 = 1 + 3*x + 9*x^2 + 46*x^3 + 306*x^4 + 2526*x^5 + 24311*x^6 +... %e A212028 A(x*A(x)^3) = 1 + x + 5*x^2 + 32*x^3 + 273*x^4 + 2715*x^5 + 30542*x^6 + 379200*x^7 + 5117211*x^8 + 74266646*x^9 + 1150267802*x^10 +... %o A212028 (PARI) {a(n)=local(A=1+x+x*O(x^n)); for(i=0, n, A=1+x*subst(A^3, x, x*A^3)); polcoeff(A, n)} %o A212028 for(n=0,30,print1(a(n),", ")) %Y A212028 Cf. A143501, A143508, A212029. %K A212028 nonn %O A212028 0,3 %A A212028 _Paul D. Hanna_, Apr 27 2012