Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A120596
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A120596 G.f. satisfies: 6*A(x) = 5 + x + A(x)^5, starting with [1,1,10]. +0
3
1, 1, 10, 210, 5505, 161601, 5082420, 167451780, 5705082795, 199354509755, 7105393162010, 257312347583330, 9440808323869455, 350189693739455535, 13110655796699158800, 494772468434359266960, 18801468275832345890970 (list; graph; listen)
OFFSET

0,3

COMMENT

See comments in A120588 for conditions needed for an integer sequence to satisfy a functional equation of the form: r*A(x) = c + b*x + A(x)^n.

FORMULA

G.f.: A(x) = 1 + Series_Reversion(1+6*x - (1+x)^5). Lagrange Inversion yields: G.f.: A(x) = Sum_{n>=0} C(5*n,n)/(4*n+1) * (5+x)^(4*n+1)/6^(5*n+1). - Paul D. Hanna (pauldhanna(AT)juno.com), Jan 24 2008

EXAMPLE

A(x) = 1 + x + 10*x^2 + 210*x^3 + 5505*x^4 + 161601*x^5 +...

A(x)^5 = 1 + 5*x + 60*x^2 + 1260*x^3 + 33030*x^4 + 969606*x^5 +...

PROGRAM

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

CROSSREFS

Cf. A120588 - A120595, A120597 - A120607.

Sequence in context: A052246 A001450 A076803 this_sequence A057408 A002967 A007698

Adjacent sequences: A120593 A120594 A120595 this_sequence A120597 A120598 A120599

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 16 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 September 6 09:40 EDT 2008. Contains 143480 sequences.


AT&T Labs Research