|
%I #5 May 18 2017 21:47:02
%S 0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,0,
%T 0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1,0,0,
%U 0,1,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,1
%N {0->00,1->01}-transform of the Sturmian word A080764.
%C A080764 = 1101101110110111011011011101..., and replacing each 0 by 00 and each 1 by 01 gives 010100010100010101000101000..., in which the positions of 0 are given by A286939, and of 1, by A286940.
%H Clark Kimberling, <a href="/A286907/b286907.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> 1, 1 -> {1, 1, 0}}] &, {1}, 11]; (* Sturmian word A080764 *)
%t w = StringJoin[Map[ToString, s]];
%t w1 = StringReplace[w, {"0" -> "00", "1" -> "01"}]
%t st = ToCharacterCode[w1] - 48 ; (* A286907 *)
%t Flatten[Position[st, 0]]; (* A286908 *)
%t Flatten[Position[st, 1]]; (* A286909 *)
%Y Cf. A080764, A286939, A286940.
%K nonn,easy
%O 1
%A _Clark Kimberling_, May 18 2017
|
