%I
%S 0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,0,
%T 0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0,0,1,1,1,
%U 0,0,0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,0
%N {0>001, 1>110}transform of the infinite Fibonacci word A003849.
%H Clark Kimberling, <a href="/A287790/b287790.txt">Table of n, a(n) for n = 1..10000</a>
%e As a word, A003849 = 0100101001001010010100100..., and replacing each 0 by 001 and each 1 by 110 gives 00111000100111000111000100111000100...
%t s = Nest[Flatten[# /. {0 > {0, 1}, 1 > {0}}] &, {0}, 10] (* A003849 *)
%t w = StringJoin[Map[ToString, s]]
%t w1 = StringReplace[w, {"0" > "001", "1" > "110"}]
%t st = ToCharacterCode[w1]  48 (* A287790 *)
%t Flatten[Position[st, 0]] (* A287791 *)
%t Flatten[Position[st, 1]] (* A287792 *)
%Y Cf. A287791, A287792.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Jun 03 2017
