OFFSET
0,2
LINKS
Harvey P. Dale, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1066
Index entries for linear recurrences with constant coefficients, signature (3,1)
FORMULA
G.f.: (-1+x+x^2)/(-1+3*x+x^2).
Recurrence: {a(0)=1, a(1)=2, a(n)+3*a(n+1)-a(n+2), a(2)=6}.
Sum(-2/13*(3*_alpha-2)*_alpha^(-1-n), _alpha=RootOf(-1+3*_Z+_Z^2)).
a(n) = Sum_{k=0..n} A155161(n,k)*2^k. - Philippe Deléham, Feb 08 2012
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
a(n) = 2*A006190(n) for n>=1. - Philippe Deléham, Mar 09 2023
MAPLE
spec := [S, {S=Sequence(Prod(Sequence(Union(Prod(Z, Z), Z)), Union(Z, Z)))}, unlabeled ]: seq(combstruct[count ](spec, size=n), n=0..20);
MATHEMATICA
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 *)
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
EXTENSIONS
More terms from James A. Sellers, Jun 06 2000
STATUS
approved