OFFSET
1,1
COMMENTS
Sequence is obtained from modulo 3 periodic sequence of Padovan numbers 1112201210010, it satisfies the same recurrence a(n) = a(n-2) + a(n-3).
LINKS
MATHEMATICA
RecurrenceTable[{a[n] == a[n - 2] + a[n - 3], a[1] == 2, a[2] == 1, a[3] == 0}, a, {n, 1, 43}] (* or *)
CoefficientList[Series[(2 x^2 - x - 2)/(x^3 + x^2 - 1), {x, 0, 42}], x] (* Michael De Vlieger, Aug 28 2016 *)
PROG
(PARI) a(n)=([0, 1, 0; 0, 0, 1; 1, 1, 0]^(n-1)*[2; 1; 0])[1, 1] \\ Charles R Greathouse IV, Aug 28 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Nicolas Bègue, Aug 26 2016
EXTENSIONS
More terms from Charles R Greathouse IV, Aug 28 2016
STATUS
approved
