Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141117
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141117 G.f.: A(x) = G(G(x)) = G(x)*[1 + A(A(x))] where G(x) = x + x*G(G(G(x))) = g.f. of A091713. +0
2
1, 2, 8, 46, 330, 2756, 25782, 263866, 2909092, 34181138, 424730866, 5549236120, 75895955810, 1082808876274, 16069706031016, 247501424330182, 3948322598675930, 65130737179097436, 1109339652229852966 (list; graph; listen)
OFFSET

1,2

FORMULA

G.f. A(x) satisfies: G( x/(1 + A(x)) ) = x where G(x) = g.f. of A091713.

EXAMPLE

G.f.: A(x) = G(G(x)) such that G(x) = A(x)/[1 + A(A(x))] where

G(x) = x + x^2 + 3*x^3 + 15*x^4 + 99*x^5 + 781*x^6 + 7001*x^7 +...

A(x) = x + 2*x^2 + 8*x^3 + 46*x^4 + 330*x^5 + 2756*x^6 + 25782*x^7 +...

A(A(x)) = x + 4*x^2 + 24*x^3 + 180*x^4 + 1564*x^5 + 15140*x^6 +...

PROGRAM

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

CROSSREFS

Cf. A091713.

Sequence in context: A003091 A119501 A006664 this_sequence A145844 A005840 A161881

Adjacent sequences: A141114 A141115 A141116 this_sequence A141118 A141119 A141120

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 04 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research