OFFSET
0,3
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (4,0,-8,-4).
FORMULA
a(n) = Sum_{k=0..n} A322942(n, k)*k.
a(n) = 2*((n^2 - n - 2)*a(n-2) + (n^2 - 2*n - 4)*a(n-1))/(n^2 - 3*n).
a(n) = n! [x^n] (1/9)*exp(x)*(sqrt(3)*(3*x+2)*sinh(sqrt(3)*x)+3*x*cosh(sqrt(3)*x)).
From Colin Barker, Jan 14 2020: (Start)
a(n) = ((1-sqrt(3))^n*(-2*sqrt(3) + 3*n) + (1+sqrt(3))^n*(2*sqrt(3) + 3*n)) / 18.
a(n) = 4*a(n-1) - 8*a(n-3) - 4*a(n-4) for n>3.
(End)
MAPLE
gf := (x - 2*x^3)/(1 - 2*x*(x + 1))^2: ser := series(gf, x, 32):
seq(coeff(ser, x, n), n=0..28);
MATHEMATICA
LinearRecurrence[ {4, 0, -8, -4}, {0, 1, 4, 14}, 28]
PROG
(PARI) concat(0, Vec(x*(1 - 2*x^2) / (1 - 2*x - 2*x^2)^2 + O(x^30))) \\ Colin Barker, Jan 14 2020
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Peter Luschny, Jan 14 2020
STATUS
approved