OFFSET
0,4
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 907
Index entries for linear recurrences with constant coefficients, signature (0,0,2,1).
FORMULA
G.f.: 1/(1 - 2*x^3 - x^4).
a(n) = 2*a(n-3) + a(n-4), with a(0)=1, a(1)=0, a(2)=0, a(3)=2.
a(n) = Sum_{alpha=RootOf(-1+2*z^3+z^4)} (1/86)*(4 +26*alpha -3*alpha^2 -6*alpha^3)*alpha^(-1-n).
MAPLE
spec := [S, {S=Sequence(Prod(Z, Z, Union(Z, Z, Prod(Z, Z))))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..50);
seq(coeff(series(1/(1 -2*x^3 -x^4), x, n+1), x, n), n = 0..50); # G. C. Greubel, Oct 16 2019
MATHEMATICA
LinearRecurrence[{0, 0, 2, 1}, {1, 0, 0, 2}, 50] (* G. C. Greubel, Oct 16 2019 *)
PROG
(PARI) my(x='x+O('x^50)); Vec(1/(1 -2*x^3 -x^4)) \\ G. C. Greubel, Oct 16 2019
(Magma) R<x>:=PowerSeriesRing(Integers(), 50); Coefficients(R!( 1/(1 -2*x^3 -x^4) )); // G. C. Greubel, Oct 16 2019
(Sage)
def A052922_list(prec):
P.<x> = PowerSeriesRing(ZZ, prec)
return P(1/(1 -2*x^3 -x^4)).list()
A052922_list(50) # G. C. Greubel, Oct 16 2019
(GAP) a:=[1, 0, 0, 2];; for n in [5..50] do a[n]:=2*a[n-3]+a[n-4]; od; a; # G. C. Greubel, Oct 16 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
EXTENSIONS
More terms from James A. Sellers, Jun 05 2000
STATUS
approved