|
|
A285255
|
|
0-limiting word of the morphism 0->10, 1-> 0110.
|
|
6
|
|
|
0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
COMMENTS
|
The morphism 0->10, 1-> 0110 has two limiting words. If the number of iterations is even, the 0-word evolves from 0 -> 10 -> 011010 -> 100110011010011010 -> 011010100110011010100110011010011010100110011010011010; if the number of iterations is odd, the 1-word evolves from 0 -> 10 -> 011010 -> 100110011010011010, as in A285258.
This is a 3-automatic sequence. See Allouche et al. link. - Michel Dekking, Oct 05 2020
|
|
LINKS
|
|
|
MATHEMATICA
|
s = Nest[Flatten[# /. {0 -> {1, 0}, 1 -> {0, 1, 1, 0}}] &, {0}, 12]; (* A285255 *)
Flatten[Position[s, 0]]; (* A285256 *)
Flatten[Position[s, 1]]; (* A285257 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|