OFFSET
0,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
FORMULA
Recurrence: n*a(n) = (7*n-5)*a(n-1) + 8*(n-1)*a(n-2). - Vaclav Kotesovec, Oct 20 2012
a(n) ~ Gamma(2/3)*2^(3*n+1)/(3^(5/6)*Pi*n^(2/3)). - Vaclav Kotesovec, Oct 20 2012
Inverse binomial transform of A004987. - Peter Bala, Jul 02 2023
EXAMPLE
G.f.: A(x) = 1 + 2*x + 13*x^2 + 80*x^3 + 538*x^4 + 3740*x^5 + 26650*x^6 +...
where 1/A(x)^3 = 1 - 6*x - 15*x^2 - 8*x^3.
The logarithm of the g.f. begins:
log(A(x)) = 2*x + 22*x^2/2 + 170*x^3/3 + 1366*x^4/4 + 10922*x^5/5 + 87382*x^6/6 +...+ A007613(n)*x^n/n +...
MATHEMATICA
CoefficientList[Series[1/((1-8*x)*(1+x)^2)^(1/3), {x, 0, 20}], x] (* Vaclav Kotesovec, Oct 20 2012 *)
PROG
(PARI) {a(n)=polcoeff(1/( (1-8*x)*(1+x)^2 +x*O(x^n) )^(1/3), n)}
(PARI) {a(n)=local(A=1+x); A=exp(sum(m=1, n+1, sum(j=0, m, binomial(3*m, 3*j))*x^m/m +x*O(x^n))); polcoeff(A, n)}
for(n=0, 31, print1(a(n), ", "))
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul D. Hanna, Sep 03 2012
STATUS
approved