OFFSET
0,2
REFERENCES
A. T. Benjamin and J. J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A. 2003, p. 47, ex. 4.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
Antonín Slavík and Marie Vestenická, Through the Tiling Glass: Tribonacci Identities, Univ. Karlova (Czechia, 2026). See p. 12.
Index entries for linear recurrences with constant coefficients, signature (2,0,1,-2,-1,-1).
FORMULA
a(0)=1, a(1)=2, a(2)=4, a(3)=9, a(4)=18, a(5)=35, a(n)=2*a(n-1)+a(n-3)- 2*a(n-4)-a(n-5)-a(n-6). - Harvey P. Dale, Nov 06 2011
MATHEMATICA
CoefficientList[Series[1/((1-x-x^2-x^3)(1-x-x^3)), {x, 0, 40}], x] (* Harvey P. Dale, Nov 06 2011 *)
(* Alternative: *)
LinearRecurrence[{2, 0, 1, -2, -1, -1}, {1, 2, 4, 9, 18, 35}, 40] (* Harvey P. Dale, Nov 06 2011 *)
PROG
(PARI) x='x+O('x^50); Vec(1/((1-x-x^2-x^3)*(1-x-x^3))) \\ G. C. Greubel, May 02 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Feb 02 2005
STATUS
approved
