OFFSET
0,2
COMMENTS
Or, a(n) = Sum_{k=0..m} (k+1)*T(n,m-k), m=n for n=0,1,2,3; m=2n for n >= 4; T given by A026082.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6,-9).
FORMULA
For n>3, a(n) = 8*(n+1)*3^(n-3).
From Colin Barker, Feb 17 2016: (Start)
a(n) = 6*a(n-1) - 9*a(n-2) for n>5.
G.f.: (1 - 3*x - x^2 - x^3 + 72*x^4 - 108*x^5) / (1-3*x)^2.
(End)
MATHEMATICA
CoefficientList[Series[(1 - 3 x - x^2 - x^3 + 72 x^4 - 108 x^5)/(1 - 3 x)^2, {x, 0, 26}], x] (* Michael De Vlieger, Feb 17 2016 *)
PROG
(PARI) Vec((1-3*x-x^2-x^3+72*x^4-108*x^5)/(1-3*x)^2 + O(x^30)) \\ Colin Barker, Feb 17 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
Edited by N. J. A. Sloane at the suggestion of Andrew S. Plewe, Jun 05 2007
STATUS
approved