%I
%S 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,
%T 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,
%U 0,1,0,0,0,1,1,0,0,0,1,1,0,0,0,1,0,0
%N {0>1, 1>000}transform of the infinite Fibonacci word A003849.
%C Guide to related sequences:
%C Transformation of A003849 Position sequences for 0 and 1
%C A287772, 0>1, 1>00 A287775, A050140
%C A287773, 0>011, 1>101 A287774, A287777
%C A287663: 0>1; 1>000 A287664, A287665
%C A287674: 0>1; 1>001 A287675, A287676
%C A287722: 0>1; 1>010 A287723, A287724
%C A287725: 0>1; 1>011 A287726, A287727
%C A287769: 0>1; 1>110 A276855, A287770
%H Clark Kimberling, <a href="/A287663/b287663.txt">Table of n, a(n) for n = 1..10000</a>
%e As a word, A003849 = 0100101001001010010100100..., and replacing each 0 by 1 and each 1 by 000 gives 100011000100011000110001000110001...
%t s = Nest[Flatten[# /. {0 > {0, 1}, 1 > {0}}] &, {0}, 10] (* A003849 *)
%t w = StringJoin[Map[ToString, s]]
%t w1 = StringReplace[w, {"0" > "1", "1" > "000"}]
%t st = ToCharacterCode[w1]  48 (* A287663 *)
%t Flatten[Position[st, 0]] (* A287664 *)
%t Flatten[Position[st, 1]] (* A287665 *)
%Y Cf. A287664, A287665.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Jun 02 2017
%E Edited by _Clark Kimberling_, Oct 09 2017
