%I #23 Jun 02 2020 23:43:05
%S 1,0,3,2,11,14,45,76,197,380,895,1838,4143,8762,19353,41496,90793,
%T 195928,426811,923802,2008307,4352902,9454021,20504420,44513581,
%U 96572820,209609143,454814022,987068631,2141901554,4648293425
%N Expansion of ( 1-x ) / ( 1-x-3*x^2+x^3 ).
%D Kenneth Edwards, Michael A. Allen, A new combinatorial interpretation of the Fibonacci numbers squared, Part II, Fib. Q., 58:2 (2020), 169-177.
%H Harvey P. Dale, <a href="/A052973/b052973.txt">Table of n, a(n) for n = 0..1000</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1045">Encyclopedia of Combinatorial Structures 1045</a>
%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (1,3,-1).
%F G.f.: -(-1+x)/(1-x-3*x^2+x^3)
%F Recurrence: {a(1)=0, a(0)=1, a(2)=3, a(n)-3*a(n+1)-a(n+2)+a(n+3)=0}
%F Sum(-1/74*(1-34*_alpha+9*_alpha^2)*_alpha^(-1-n), _alpha=RootOf(1-_Z-3*_Z^2+_Z^3))
%F a(n) = A125691(n)-A125691(n-1). - _R. J. Mathar_, Feb 27 2019
%p spec := [S,{S=Sequence(Prod(Union(Prod(Union(Z,Z),Sequence(Z)),Z),Z))},unlabeled ]: seq(combstruct[count ](spec,size=n), n=0..20);
%t CoefficientList[Series[(1-x)/(1-x-3x^2+x^3),{x,0,30}],x] (* or *) LinearRecurrence[{1,3,-1},{1,0,3},40] (* _Harvey P. Dale_, Sep 06 2017 *)
%K easy,nonn
%O 0,3
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E More terms from _James A. Sellers_, Jun 06 2000
|