|
|
A273129
|
|
The Rote-Fibonacci infinite sequence.
|
|
24
|
|
|
0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
This is an aperiodic sequence that avoids the pattern x x x^R, where x is a nonempty block and x^R denotes the reversal of x.
It can be generated as the limit of the words R(i), where R(0) = 0, R(1) = 00, and R(n) = R(n-1)R(n-2) if n == 0 (mod 3), and R(n) = R(n-1) c(R(n-2)) if n == 1, 2 (mod 3), where c flips 0 to 1 and vic-versa.
It can also be generated as the image, under the coding that maps a, b -> 0 and c, d -> 1, of the fixed point (see A316340), starting with a, of the morphism a -> abcab, b -> cda, c -> cdacd, d -> abc.
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|