A272664 (001)(001)(001)(10)*.

0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0

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)

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

Cf. A241903.

Sequence in context: A072785 A188297 A289128 * A143518 A122414 A288216

Adjacent sequences: A272661 A272662 A272663 * A272665 A272666 A272667

Keyword

nonn,easy

Author

N. J. A. Sloane, May 15 2016

Status

approved