%I #35 Sep 08 2022 08:44:59
%S 1,0,0,2,2,2,6,10,14,26,46,74,126,218,366,618,1054,1786,3022,5130,
%T 8702,14746,25006,42410,71902,121914,206734,350538,594366,1007834,
%U 1708910,2897642,4913310,8331130,14126414,23953034,40615294,68868122,116774190,198004778
%N Expansion of (1-x)/(1-x-2*x^3).
%H G. C. Greubel, <a href="/A052537/b052537.txt">Table of n, a(n) for n = 0..1000</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=468">Encyclopedia of Combinatorial Structures 468</a>
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,2).
%F G.f.: (1-x)/(1 - x - 2*x^3)
%F a(n) = a(n-1) + 2*a(n-3), with a(0)=1, a(1)=0, a(2)=0.
%F a(n) = Sum_{alpha = RootOf(-1+x+2*x^3)} (-1/29)*(1 - 10*alpha + 3*alpha^2)*alpha^(-1-n).
%F a(n) = Sum_{k=1..floor((n-1)/2)} binomial(n-1-2*k, k-1)*2^k, n>=1. - _Taras Goy_, Sep 18 2019
%p spec := [S,{S=Sequence(Prod(Z,Z,Union(Z,Z),Sequence(Z)))},unlabeled]: seq(combstruct[count](spec,size=n), n=0..20);
%t CoefficientList[Series[(1-x)/(1-x-2x^3),{x,0,50}],x] (*or*) LinearRecurrence[ {1,0,2},{1,0,0},50] (* _Vladimir Joseph Stephan Orlovsky_, Jan 28 2012 *)
%o (PARI) my(x='x+O('x^50)); Vec((1-x)/(1-x-2*x^3)) \\ _G. C. Greubel_, May 09 2019
%o (Magma) R<x>:=PowerSeriesRing(Integers(), 50); Coefficients(R!( (1-x)/(1-x-2*x^3) )); // _G. C. Greubel_, May 09 2019
%o (Sage) ((1-x)/(1-x-2*x^3)).series(x, 50).coefficients(x, sparse=False) # _G. C. Greubel_, May 09 2019
%o (GAP) a:=[1,0,0];; for n in [4..50] do a[n]:=a[n-1]+2*a[n-3]; od; a; # _G. C. Greubel_, May 09 2019
%Y Cf. A003229.
%K easy,nonn
%O 0,4
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E More terms from _James A. Sellers_, Jun 05 2000