|
%I #8 Jun 03 2017 15:26:31
%S 1,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,0,
%T 1,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,1,0,1,1,1,1,0,1,
%U 1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,1,0,1
%N {0->1, 1->011}-transform of the infinite Fibonacci word A003849.
%H Clark Kimberling, <a href="/A287725/b287725.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 011 gives 10111101110111101111011101111011101111011110...
%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" -> "011"}]
%t st = ToCharacterCode[w1] - 48 (* A287725 *)
%t Flatten[Position[st, 0]] (* A287726 *)
%t Flatten[Position[st, 1]] (* A287727 *)
%Y Cf. A287726, A287727.
%K nonn,easy
%O 1
%A _Clark Kimberling_, Jun 02 2017
|
