|
|
A287663
|
|
{0->1, 1->000}-transform of the infinite Fibonacci word A003849.
|
|
3
|
|
|
1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1
|
|
COMMENTS
|
Guide to related sequences:
Transformation of A003849 Position sequences for 0 and 1
|
|
LINKS
|
|
|
EXAMPLE
|
As a word, A003849 = 0100101001001010010100100..., and replacing each 0 by 1 and each 1 by 000 gives 100011000100011000110001000110001...
|
|
MATHEMATICA
|
s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 10] (* A003849 *)
w = StringJoin[Map[ToString, s]]
w1 = StringReplace[w, {"0" -> "1", "1" -> "000"}]
st = ToCharacterCode[w1] - 48 (* A287663 *)
Flatten[Position[st, 0]] (* A287664 *)
Flatten[Position[st, 1]] (* A287665 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|