|
%I #4 May 14 2017 15:53:56
%S 1,0,1,0,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,1,0,1,0,
%T 1,0,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,1,0,1,0,1,0,
%U 0,1,0,1,1,0,1,0,1,0,0,1,0,1,1,0,1,0
%N {010010->null}-transform of the infinite Fibonacci word A003849.
%C As a word, A003849 = 01001010010010100101001001010010..., and deleting each occurrence of 010010 gives 10100101011010010101101001001..., in which the positions of 0 are given by A286753, and of 1, by A286754.
%H Clark Kimberling, <a href="/A286752/b286752.txt">Table of n, a(n) for n = 1..10000</a>
%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {0}}] &, {0}, 12]; (* A003849 *)
%t w = StringJoin[Map[ToString, s]];
%t w1 = StringReplace[w, {"010010" -> ""}];
%t st = ToCharacterCode[w1] - 48; (* A286752 *)
%t Flatten[Position[st, 0]]; (* A286753 *)
%t Flatten[Position[st, 1]]; (* A286754 *)
%Y Cf. A003849, A286753, A286754.
%K nonn,easy
%O 1
%A _Clark Kimberling_, May 14 2017
|
