login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A120592 G.f. satisfies: 5*A(x) = 4 + 4*x + A(x)^3, starting with [1,2,6]. 5

%I #13 May 23 2013 21:50:27

%S 1,2,6,40,330,3048,30156,312528,3349170,36809960,412651668,4700098416,

%T 54237852708,632762593680,7450815536280,88435205367456,

%U 1056940049423682,12708927083800296,153636691533864900,1866178021496170800

%N G.f. satisfies: 5*A(x) = 4 + 4*x + A(x)^3, starting with [1,2,6].

%C 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.

%H Vincenzo Librandi, <a href="/A120592/b120592.txt">Table of n, a(n) for n = 0..70</a>

%F G.f.: A(x) = 1 + Series_Reversion((1+5*x - (1+x)^3)/4).

%F G.f.: A(x) = Sum_{n>=0} C(3*n,n)/(2*n+1) * (4+4*x)^(2*n+1) / 5^(3*n+1), due to Lagrange Inversion.

%F Recurrence: 17*(n-1)*n*a(n) = 108*(n-1)*(2*n-3)*a(n-1) + 12*(3*n-7)*(3*n-5)*a(n-2). - _Vaclav Kotesovec_, Oct 19 2012

%F a(n) ~ sqrt(250-60*sqrt(15))*((108+30*sqrt(15))/17)^n/(30*sqrt(Pi)*n^(3/2)). - _Vaclav Kotesovec_, Oct 19 2012

%e A(x) = 1 + 2*x + 6*x^2 + 40*x^3 + 330*x^4 + 3048*x^5 + 30156*x^6 +...

%e A(x)^3 = 1 + 6*x + 30*x^2 + 200*x^3 + 1650*x^4 +15240*x^5 +150780*x^6 +...

%t FullSimplify[Table[SeriesCoefficient[Sum[Binomial[3*k,k]/(2*k+1)*(4+4*x)^(2*k+1)/5^(3*k+1),{k,0,Infinity}],{x,0,n}],{n,0,20}]] (* _Vaclav Kotesovec_, Oct 19 2012 *)

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

%Y Cf. A120588 - A120591, A120593 - A120607.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Jun 16 2006, Jan 24 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)