OFFSET
1,3
COMMENTS
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
Hamoon Mousavi and Jeffrey Shallit, Mechanical Proofs of Properties of the Tribonacci Word, arXiv:1407.5841 [cs.FL], 2014.
H. Mousavi and J. Shallit, Mechanical Proofs of Properties of the Tribonacci Word, In: Manea F., Nowotka D. (eds) Combinatorics on Words. WORDS 2015. Lecture Notes in Computer Science, vol 9304. Springer, 2015, pp. 170-190.
Index entries for linear recurrences with constant coefficients, signature (0,1,0,1,0,1).
FORMULA
From Colin Barker, Jun 11 2019: (Start)
G.f.: x^2*(1 + 2*x + 2*x^2 + 2*x^3 + 2*x^4 + x^5 + x^6) / (1 - x^2 - x^4 - x^6).
a(n) = a(n-2) + a(n-4) + a(n-6) for n>8.
(End)
MATHEMATICA
LinearRecurrence[{0, 1, 0, 1, 0, 1}, {0, 1, 2, 3, 4, 6, 7, 11}, 100] (* Paolo Xausa, Nov 14 2023 *)
PROG
(PARI) concat(0, Vec(x^2*(1 + 2*x + 2*x^2 + 2*x^3 + 2*x^4 + x^5 + x^6) / (1 - x^2 - x^4 - x^6) + O(x^50))) \\ Colin Barker, Jun 11 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jun 09 2019
STATUS
approved