|
%I #4 May 20 2017 10:21:28
%S 0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,
%T 0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,
%U 0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0
%N {0->000, 11->null}-transform of the Sturmian word A080764.
%C A080764 = 1101101110110111011011011101..., and replacing each 0 by 000 and deleting each 11 gives 000000100000010000000001000000100..., in which the positions of 0 are given by A286997, and of 1, by A188383.
%H Clark Kimberling, <a href="/A286996/b286996.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" -> "000", "11"->""}]
%t st = ToCharacterCode[w1] - 48 ; (* A286996 *)
%t Flatten[Position[st, 0]]; (* A286997 *)
%t Flatten[Position[st, 1]]; (* A188383 *)
%Y Cf. A080764, A286997, A188383.
%K nonn,easy
%O 1
%A _Clark Kimberling_, May 19 2017
|
