OFFSET
0
COMMENTS
Three copies of 001 followed by infinitely many copies of 10.
Lexicographically least binary sequence containing no subblock of the form S S reverse(S).
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Jeffrey Shallit, Experimental Combinatorics on Words Using the Walnut Prover, Talk Presented at Computational Discovery in Mathematics (ACMES 2), University of Western Ontario, May 12 2016
Index entries for linear recurrences with constant coefficients, signature (0,1).
FORMULA
From Colin Barker, May 16 2016: (Start)
a(n) = (1-(-1)^n)/2 for n>8.
a(n) = a(n-2) for n>10.
G.f.: x^2*(1+x^3-x^4)*(1-x^2+x^4) / ((1-x)*(1+x)).
(End)
MATHEMATICA
Join[PadRight[{}, 9, {0, 0, 1}], PadRight[{}, 120, {1, 0}]] (* Harvey P. Dale, Oct 11 2024 *)
PROG
(PARI) concat(vector(2), Vec(x^2*(1+x^3-x^4)*(1-x^2+x^4)/((1-x)*(1+x)) + O(x^50))) \\ Colin Barker, May 16 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 15 2016
STATUS
approved