Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121687
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121687 G.f. satisfies: A(x) = 1 + x*A(x) * A( x*A(x) )^2. +0
2
1, 1, 3, 14, 83, 574, 4432, 37244, 335153, 3194510, 32001596, 335019839, 3649450270, 41227610316, 481724831132, 5809341783543, 72177761136925, 922539273876404, 12115001489115910, 163284755614174305 (list; graph; listen)
OFFSET

0,3

FORMULA

G.f. satisfies: G(x) = x/(1 + x*A(x)^2) where G(x*A(x)) = x.

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

EXAMPLE

G.f. A(x) = 1 + x + 3*x^2 + 14*x^3 + 83*x^4 + 574*x^5 + 4432*x^6 +...

A(x)^2 = 1 + 2*x + 7*x^2 + 34*x^3 + 203*x^4 + 1398*x^5 + 10706*x^6 +...

A(x*A(x)) = 1 + x + 4*x^2 + 23*x^3 + 160*x^4 + 1259*x^5 + 10833*x^6 +...

A(x*A(x))^2 = 1 + 2*x + 9*x^2 + 54*x^3 + 382*x^4 + 3022*x^5 + 25993*x^6 +...

A(x)*A(x*A(x))^2 = 1 + 3*x + 14*x^2 + 83*x^3 + 574*x^4 + 4432*x^5 +...

PROGRAM

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

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

CROSSREFS

Sequence in context: A032080 A020104 A103467 this_sequence A154757 A074535 A005700

Adjacent sequences: A121684 A121685 A121686 this_sequence A121688 A121689 A121690

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 15 2006, Aug 20 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 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research