login
A287795
{0->101, 1->010}-transform of the infinite Fibonacci word A003849.
2
1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0
OFFSET
1
COMMENTS
a(n) = 1 - A287773(n) for n >= 1.
LINKS
EXAMPLE
As a word, A003849 = 0100101001001010010100100..., and replacing each 0 by 101 and each 1 by 010 gives 10101010110101010101010110101010110...
MATHEMATICA
s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 10] (* A003849 *)
w = StringJoin[Map[ToString, s]]
w1 = StringReplace[w, {"0" -> "101", "1" -> "010"}]
st = ToCharacterCode[w1] - 48 (* A287795 *)
Flatten[Position[st, 0]] (* A287777 *)
Flatten[Position[st, 1]] (* A287774 *)
CROSSREFS
Cf. A287774, A287777, A287773 (binary complement).
Sequence in context: A193497 A260390 A179758 * A267704 A174888 A162549
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, Jun 03 2017
STATUS
approved