login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A137972
G.f. satisfies A(x) = 1 + x*(1 + x*A(x)^4)^6.
6
1, 1, 6, 39, 320, 2787, 25788, 247731, 2449188, 24753960, 254610962, 2656496133, 28046838948, 299085697722, 3216723340218, 34852657892685, 380063012970680, 4168108473073596, 45941874232280862, 508664757809869052
OFFSET
0,3
LINKS
FORMULA
G.f.: A(x) = 1 + x*B(x)^6 where B(x) is the g.f. of A137971.
a(n) = Sum_{k=0..n-1} C(6*(n-k),k)/(n-k) * C(4*k,n-k-1) for n>0 with a(0)=1. - Paul D. Hanna, Jun 16 2009
a(n) ~ sqrt(6*s*(1-s)*(4-5*s) / ((184*s - 144)*Pi)) / (n^(3/2) * r^n), where r = 0.0833821738312503523008482260558417829257343369560... and s = 1.287689442730957770948767878255357456556632139740... are real roots of the system of equations s = 1 + r*(1 + r*s^4)^6, 24 * r^2 * s^3 * (1 + r*s^4)^5 = 1. - Vaclav Kotesovec, Nov 22 2017
PROG
(PARI) {a(n)=local(A=1+x*O(x^n)); for(i=0, n, A=1+x*(1+x*A^4)^6); polcoeff(A, n)}
(PARI) a(n)=if(n==0, 1, sum(k=0, n-1, binomial(6*(n-k), k)/(n-k)*binomial(4*k, n-k-1))) \\ Paul D. Hanna, Jun 16 2009
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Feb 26 2008
STATUS
approved