Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141371
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141371 G.f. satisfies: A(x) = x + A(A(A(x))^2). +0
5
1, 1, 4, 25, 190, 1648, 15700, 160834, 1747372, 19945264, 237585064, 2938737760, 37602695500, 496263658816, 6739460289568, 94002095361937, 1344557294558722, 19696746902333368, 295199862739677892, 4522172757314573464 (list; graph; listen)
OFFSET

1,3

FORMULA

G.f. satisfies: A( x - A(A(x)^2) ) = x.

EXAMPLE

G.f.: A(x) = x + x^2 + 4*x^3 + 25*x^4 + 190*x^5 + 1648*x^6 + 15700*x^7 +...

The series reversion of A(x) = x - A(A(x)^2), where

A(A(x)^2) = x^2 + 2*x^3 + 10*x^4 + 62*x^5 + 472*x^6 + 4052*x^7 + 38227*x^8 +...

PROGRAM

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

CROSSREFS

Cf. A141370, A141372.

Adjacent sequences: A141368 A141369 A141370 this_sequence A141372 A141373 A141374

Sequence in context: A054368 A135147 A064063 this_sequence A060908 A036449 A051500

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 28 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