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 A215114 #6 Aug 03 2012 14:53:30
%S A215114 1,3,9,81,891,11907,184437,3199581,60932007,1257133527,27836230041,
%T A215114 656867748537,16429561047891,433686821472747,12038953175046909,
%U A215114 350402975398982133,10665927632978564895,338769129913521564735,11205026468737167058785
%N A215114 G.f. satisfies: A(x) = x + 2*x^2 + x*A(A(A(x))).
%C A215114 The (1/3)-iteration of the g.f. equals an integer series (A215115).
%F A215114 G.f. satisfies: A(x) = G(x)/G(G(x)) - 1 - G(G(x)) where A(G(x)) = x.
%e A215114 G.f.: A(x) = x + 3*x^2 + 9*x^3 + 81*x^4 + 891*x^5 + 11907*x^6 + 184437*x^7 +...
%e A215114 where
%e A215114 A(A(A(x))) = x + 9*x^2 + 81*x^3 + 891*x^4 + 11907*x^5 + 184437*x^6 +...
%e A215114 Related expansions.
%e A215114 Let C(C(C(x))) = A(x), then C(x) is an integer series where:
%e A215114 C(x) = x + x^2 + x^3 + 19*x^4 + 163*x^5 + 2269*x^6 + 34093*x^7 +...
%e A215114 where the coefficients of C(x) are congruent to 1 modulo 9.
%o A215114 (PARI) {a(n)=local(A=x+3*x^2); for(i=1, n, A=x+2*x^2+x*subst(A, x, subst(A, x, A+x*O(x^n)))); polcoeff(A, n)}
%o A215114 for(n=1, 31, print1(a(n), ", "))
%Y A215114 Cf. A215115, A213010, A215116, A215118.
%K A215114 nonn
%O A215114 1,2
%A A215114 _Paul D. Hanna_, Aug 03 2012