Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088714
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088714 G.f. satisfies: A(x) = 1 + x*A(x)^2*A(x*A(x)). +0
11
1, 1, 3, 13, 69, 419, 2809, 20353, 157199, 1281993, 10963825, 97828031, 907177801, 8716049417, 86553001779, 886573220093, 9351927111901, 101447092428243, 1130357986741545, 12923637003161409, 151479552582252239 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f.: A(x) = f(x*A(x)) = (1-1/f(x))/x where f(x) is the g.f. of A088713.

Given g.f. A(x), then B(x)=x*A(x) satisfies 0=f(x, B(x), B(B(x))) where f(a0, a1, a2)=a0-a1+a1*a2 . - Michael Somos May 21 2005

G.f. satisfies: A(x) = 1/(1 - x*A(x)*A(x*A(x))).

G.f. satisfies: A(x) = (1/x)*Series_Reversion(x - x^2*A(x)).

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 + xAB;

B = A + xBC;

C = B + xCD;

D = C + xDE;

E = D + xEF ; ...

PROGRAM

(PARI) {a(n)=local(A); if(n<0, 0, n++; A=x+O(x^2); for(i=2, n, A=x/(1-subst(A, x, A))); polcoeff(A, n))} /* Michael Somos May 21 2005 */

(PARI) {a(n)=local(A); if(n<0, 0, A=1+x+O(x^2); for(i=1, n, A=1/(1-x*A*subst(A, x, x*A))); polcoeff(A, n))}

(PARI) {a(n)=local(A); if(n<0, 0, A=1+x+O(x^2); for(i=0, n, A=(1/x)*serreverse(x-x^2*A)); polcoeff(A, n))}

CROSSREFS

Cf. A088713.

Apart from signs, same as A067145. - Philippe DELEHAM, Jun 18 2006

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

Adjacent sequences: A088711 A088712 A088713 this_sequence A088715 A088716 A088717

Sequence in context: A128079 A074534 A067145 this_sequence A088368 A007808 A104989

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 12 2003, May 22 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research