

A308901


Lexicographically earliest overlapfree binary sequence.


0



0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1


COMMENTS



REFERENCES

M. Lothaire, Combinatorics on Words. AddisonWesley, Reading, MA, 1983, p. 20 (definition of "overlap").
J. Shallit, A second course in formal languages and automata theory, Cambridge, 2009, pp. 3739.


LINKS

J.P. Allouche and Jeffrey Shallit, The Ubiquitous ProuhetThueMorse Sequence, in C. Ding. T. Helleseth and H. Niederreiter, eds., Sequences and Their Applications: Proceedings of SETA '98, SpringerVerlag, 1999, pp. 116.


FORMULA

0,0,1,0,0,1 followed by a version of the ThueMorse sequence A010060.


MATHEMATICA

Join[{0, 0, 1, 0, 0, 1}, 1ThueMorse[Range[0, 200]]] (* Paolo Xausa, Dec 19 2023 *)


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



