login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120971 G.f. satisfies: A(x) = 1 + x*A(x)^2*[A(x*A(x)^2)]^2. 11
1, 1, 4, 26, 218, 2151, 23854, 289555, 3783568, 52624689, 772928988, 11918181144, 192074926618, 3224153299106, 56213565222834, 1015694652332437, 18982833869517376, 366384235565593176, 7292660345274942402 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

FORMULA

G.f. A(x) satisfies: A(x) = G(G(x)-1), A(G(x)-1) = G(A(x)-1), A(x) = G(x*A(x)^2) and A(x/G(x)^2) = G(x), where G(x) is the g.f. of A120970 and satisfies G(x/G(x)^2) = 1 + x.

G.f. A(x) = F(x,1) where F(x,n) satisfies: F(x,n) = F(x,n-1)*(1 + x*F(x,n+1)^2) for n>0 with F(x,0)=1. - Paul D. Hanna (pauldhanna(AT)juno.com), Apr 16 2007

EXAMPLE

Comment from Paul D. Hanna (pauldhanna(AT)juno.com), Apr 16 2007: G.f. A(x) is the unique solution to variable A in the infinite system of simultaneous equations:

A = 1 + xB^2;

B = A*(1 + xC^2);

C = B*(1 + xD^2);

D = C*(1 + xE^2);

E = D*(1 + xF^2) ; ...

PROG

(PARI) {a(n)=local(A, G=[1, 1]); for(i=1, n, G=concat(G, 0); G[ #G]=-Vec(subst(Ser(G), x, x/Ser(G)^2))[ #G]); A=Vec(((Ser(G)-1)/x)^(1/2)); A[n+1]}

CROSSREFS

Cf. A120970; variants: A120973, A120975, A120977.

Cf. A002449, A030266, A087949, A088714, A088717, A091713.

Sequence in context: A048351 A143436 A135884 * A145347 A089816 A152407

Adjacent sequences:  A120968 A120969 A120970 * A120972 A120973 A120974

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 20 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 14:37 EST 2012. Contains 205930 sequences.