|
%I #4 Jun 03 2017 15:27:56
%S 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,
%T 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,
%U 0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0
%N {0->101, 1->010}-transform of the infinite Fibonacci word A003849.
%C a(n) = 1 - A287773(n) for n >= 1.
%H Clark Kimberling, <a href="/A287795/b287795.txt">Table of n, a(n) for n = 1..10000</a>
%e As a word, A003849 = 0100101001001010010100100..., and replacing each 0 by 101 and each 1 by 010 gives 10101010110101010101010110101010110...
%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 10] (* A003849 *)
%t w = StringJoin[Map[ToString, s]]
%t w1 = StringReplace[w, {"0" -> "101", "1" -> "010"}]
%t st = ToCharacterCode[w1] - 48 (* A287795 *)
%t Flatten[Position[st, 0]] (* A287777 *)
%t Flatten[Position[st, 1]] (* A287774 *)
%Y Cf. A287774, A287777, A287773 (binary complement).
%K nonn,easy
%O 1
%A _Clark Kimberling_, Jun 03 2017
|
