Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120566 G.f. satisfies: A(x) = A(A(x)) - x*A(A(A(x))), with A(0)=0. +0
1
1, 1, 1, 3, 7, 33, 109, 643, 2623, 17929, 85349, 652395, 3517911, 29484193, 176844781, 1605009651, 10575269935, 103033059513, 738834271605, 7676696689275, 59466011617671, 655467253898577, 5451048833933693 (list; graph; listen)
OFFSET

1,4

FORMULA

G.f. satisfies: A(-A(-x)) = x ; Also: A(x) = x + A(A(x))*series_reversion(A(x)).

Since g.f. satisfies: A(A(x)) = ( x - A(x) )/A(-x), then higher order self-compositions of A(x) reduce into expressions involving A(x) and A(-x). - Paul D. Hanna (pauldhanna(AT)juno.com), Jul 22 2006

EXAMPLE

A(x) = x + x^2 + x^3 + 3x^4 + 7x^5 + 33x^6 + 109x^7 + 643x^8 +...

A(A(x)) = x + 2x^2 + 4x^3 + 12x^4 + 40x^5 + 168x^6 + 736x^7 + 3784x^8+..

x*A(A(A(x))) = x^2 + 3x^3 + 9x^4 + 33x^5 + 135x^6 + 627x^7 + 3141x^8+...

PROGRAM

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

CROSSREFS

Sequence in context: A089622 A143967 A007646 this_sequence A057480 A051256 A057795

Adjacent sequences: A120563 A120564 A120565 this_sequence A120567 A120568 A120569

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 14 2006

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research