login
A099787
a(n) = Sum_{k=0..floor(n/4)} C(n-k,3*k) * 2^k * 3^(n-4*k).
6
1, 3, 9, 27, 83, 267, 909, 3267, 12235, 46983, 182529, 711099, 2764619, 10704147, 41257341, 158371011, 605932099, 2312728095, 8812918161, 33549513579, 127652354627, 485608571547, 1847326271949, 7028217617859, 26742885359131
OFFSET
0,2
COMMENTS
In general a(n) = Sum_{k=0..floor(n/4)} C(n-k,3*k) * u^k * v^(n-4*k) has g.f. (1-v*x)^2/((1-v*x)^3 - u*x^4) and satisfies the recurrence a(n) = 3*v*a(n-1) - 3*v^2*a(n-2) + v^3*a(n-3) + u*a(n-4).
FORMULA
G.f.: (1-3*x)^2/((1-3*x)^3 - 2*x^4).
a(n) = 9*a(n-1) - 27*a(n-2) + 27*a(n-3) + 2*a(n-4).
MAPLE
seq(coeff(series((1-3*x)^2/((1-3*x)^3 - 2*x^4), x, n+1), x, n), n = 0..30); # G. C. Greubel, Sep 04 2019
MATHEMATICA
LinearRecurrence[{9, -27, 27, 2}, {1, 3, 9, 27}, 30] (* G. C. Greubel, Sep 04 2019 *)
PROG
(PARI) my(x='x+O('x^30)); Vec((1-3*x)^2/((1-3*x)^3 - 2*x^4)) \\ G. C. Greubel, Sep 04 2019
(Magma) I:=[1, 3, 9, 27]; [n le 4 select I[n] else 9*Self(n-1) - 27*Self(n-2) + 27*Self(n-3) + 2*Self(n-4): n in [1..30]]; // G. C. Greubel, Sep 04 2019
(Sage)
def A099787_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P((1-3*x)^2/((1-3*x)^3 - 2*x^4)).list()
A099787_list(30) # G. C. Greubel, Sep 04 2019
(GAP) a:=[1, 3, 9, 27];; for n in [5..30] do a[n]:=9*a[n-1]-27*a[n-2] + 27*a[n-3] +2*a[n-4]; od; a; # G. C. Greubel, Sep 04 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Oct 26 2004
STATUS
approved