|
%I #44 Mar 09 2023 19:53:13
%S 1,2,6,20,66,218,720,2378,7854,25940,85674,282962,934560,3086642,
%T 10194486,33670100,111204786,367284458,1213058160,4006458938,
%U 13232434974,43703763860,144343726554,476734943522,1574548557120,5200380614882,17175690401766,56727451820180
%N Expansion of (1-x-x^2)/(1-3x-x^2).
%H Harvey P. Dale, <a href="/A052991/b052991.txt">Table of n, a(n) for n = 0..1000</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1066">Encyclopedia of Combinatorial Structures 1066</a>
%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (3,1)
%F G.f.: (-1+x+x^2)/(-1+3*x+x^2).
%F Recurrence: {a(0)=1, a(1)=2, a(n)+3*a(n+1)-a(n+2), a(2)=6}.
%F Sum(-2/13*(3*_alpha-2)*_alpha^(-1-n), _alpha=RootOf(-1+3*_Z+_Z^2)).
%F a(n) = Sum_{k=0..n} A155161(n,k)*2^k. - _Philippe Deléham_, Feb 08 2012
%F G.f.: 1/Q(0), where Q(k) = 1 + x^2 - (2*k+1)*x + x*(2*k-1 - x)/Q(k+1); (continued fraction). - _Sergei N. Gladkovskii_, Oct 05 2013
%F a(n) = A006190(n+1)-A006190(n)-A006190(n-1). - _R. J. Mathar_, Feb 27 2019
%F a(n) = 2*A006190(n) for n>=1. - _Philippe Deléham_, Mar 09 2023
%p spec := [S,{S=Sequence(Prod(Sequence(Union(Prod(Z,Z),Z)),Union(Z,Z)))},unlabeled ]: seq(combstruct[count ](spec,size=n), n=0..20);
%t CoefficientList[Series[(1-x-x^2)/(1-3x-x^2),{x,0,30}],x] (* or *) LinearRecurrence[{3,1},{1,2,6},30] (* _Harvey P. Dale_, May 10 2022 *)
%Y Cf. A006190, A155161.
%K easy,nonn
%O 0,2
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E More terms from _James A. Sellers_, Jun 06 2000
|
