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 A120956 #15 Sep 21 2019 12:26:45
%S A120956 1,1,2,8,50,412,4120,47840,628130,9164600,146786980,2557718352,
%T A120956 48147082520,973612557504,21050077835440,484637221115520,
%U A120956 11839623684281890,305949448095405252,8339153054042801704
%N A120956 G.f. A(x) satisfies x / Series_Reversion(x*A(x)) = (A(x) + 1+x)/2.
%C A120956 The g.f. for A120955 = x / Series_Reversion(x*A(x)) = (A(x) + 1+x)/2.
%C A120956 a(n) = 2 (mod 4) when n = 2^k for k > 0. - _Paul D. Hanna_, Sep 21 2019
%C A120956 a(n) = 4 (mod 8) when n = A140138(k) for k > 0. - _Paul D. Hanna_, Sep 21 2019
%H A120956 Paul D. Hanna, <a href="/A120956/b120956.txt">Table of n, a(n) for n = 0..400</a>
%F A120956 a(n) = 2*A120955(n) for n>=2.
%F A120956 G.f. A(x) satisfies:
%F A120956 (1) A( 2x/(A(x) + 1+x) ) = (A(x) + 1+x)/2.
%F A120956 (2) A(x) = F(x*A(x)) and F(x) = A(x/F(x)) where F(x) = g.f. of A120955.
%F A120956 (3) A(x) = (1 + A(x*A(x))) / (2-x).
%F A120956 (4) A(x) = 1 + Sum_{n>=0} G_n(x)/2^(n+1) where G(x)=x*A(x) and G_{n+1}(x) = G_n(x*A(x)) denotes iteration with G_0(x)=x. [From _Paul D. Hanna_, Sep 04 2010]
%e A120956 A(x) = 1 + x + 2*x^2 + 8*x^3 + 50*x^4 + 412*x^5 + 4120*x^6 +...
%e A120956 The g.f. of A120955 is:
%e A120956 x/series_reversion(x*A(x)) = 1 + x + x^2 + 4*x^3 + 25*x^4 + 206*x^5 +...
%e A120956 Compare terms to see that A120955(n) = a(n)/2 for n>=2.
%e A120956 A(x*A(x)) = 1 + x + 3*x^2 + 14*x^3 + 92*x^4 + 774*x^5 +...
%e A120956 A(x)*(2-x) = 2 + x + 3*x^2 + 14*x^3 + 92*x^4 + 774*x^5 +...
%e A120956 Contribution from _Paul D. Hanna_, Sep 04 2010: (Start)
%e A120956 Let G(x) = x*A(x), then
%e A120956 A(x) = 1 + G(x)/2 + G(G(x))/2^2 + G(G(G(x)))/2^3 + G(G(G(G(x))))/2^4 + G(G(G(G(G(x)))))/2^5 +...
%e A120956 The table of coefficients in the iterations of G(x) = x*A(x) begin:
%e A120956 [1, 1, 2, 8, 50, 412, 4120, 47840, 628130, ...];
%e A120956 [1, 2, 6, 27, 170, 1380, 13580, 155568, 2020526, ...];
%e A120956 [1, 3, 12, 63, 422, 3482, 34208, 389007, 5010678, ...];
%e A120956 [1, 4, 20, 122, 892, 7690, 76900, 878032, 11284106, ...];
%e A120956 [1, 5, 30, 210, 1690, 15490, 160464, 1864844, 24130948, ...];
%e A120956 [1, 6, 42, 333, 2950, 29002, 315184, 3775392, 49699640, ...];
%e A120956 [1, 7, 56, 497, 4830, 51100, 587104, 7318983, 98962072, ...];
%e A120956 [1, 8, 72, 708, 7512, 85532, 1043032, 13621120, 190640924, ...];
%e A120956 [1, 9, 90, 972, 11202, 137040, 1776264, 24394608, 355390206, ...]; ...
%e A120956 in which the following sum along column k equals a(k+1):
%e A120956 a(2) = 2 = 1/2 + 2/4 + 3/8+ 4/16 + 5/32 + 6/64 +...
%e A120956 a(3) = 8 = 2/2 + 6/4 + 12/8 + 20/16 + 30/32 + 42/64 + ...
%e A120956 a(4) = 50 = 8/2 + 27/4 + 63/8 + 122/16 + 210/32 + 333/64 +...
%e A120956 a(5) = 412 = 50/2 + 170/4 + 422/8 + 892/16 + 1690/32 + 2950/64 +... (End)
%o A120956 (PARI) {a(n)=local(A=[1,1]);for(i=1,n,A=concat(A,t); A[ #A]=subst(Vec(serreverse(x/Ser(A)))[ #A],t,0)); Vec(serreverse(x/Ser(A)))[n+1]}
%o A120956 for(n=0,30, print1(a(n),", "))
%o A120956 (PARI) /* Prints N terms using x/Series_Reversion(x*A(x)) = (A(x) + 1+x)/2 */
%o A120956 N = 30; {A=[1,1]; for(i=1,N, A = concat(A, -2*Vec(x/serreverse(x*Ser(concat(A,0))))[#A+1]); print1(i,",") );A} \\ _Paul D. Hanna_, Sep 21 2019
%Y A120956 Cf. A120955.
%K A120956 nonn
%O A120956 0,3
%A A120956 _Paul D. Hanna_, Jul 19 2006