%I #4 May 09 2017 17:39:55
%S 1,7,8,10,15,18,19,25,26,28,31,32,37,43,44,46,51,54,55,60,66,67,69,72,
%T 73,79,80,82,87,90,91,97,98,100,103,104,109,115,116,118,121,122,128,
%U 129,131,136,139,140,145,151,152,154,159,162,163,169,170,172,175
%N Positions of 0 in A286419; complement of A286421.
%C a(n) - a(n-1) is in {1,2,3,5,6} for n>=2. Conjecture: a(n)/n -> 3.
%H Clark Kimberling, <a href="/A286420/b286420.txt">Table of n, a(n) for n = 1..10000</a>
%e As a word, A286419 = 011111001011110110011..., in which 0 is in positions 1,7,8,10,15,...
%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {1, 0}}] &, {0}, 9] (* A010060 *)
%t w = StringJoin[Map[ToString, s]]
%t w1 = StringReplace[w, {"0100" -> "1"}]
%t st = ToCharacterCode[w1] - 48 (* A286419 *)
%t Flatten[Position[st, 0]] (* A286420 *)
%t Flatten[Position[st, 1]] (* A286421 *)
%Y Cf. A010060, A286419, A286421.
%K nonn,easy
%O 1,2
%A _Clark Kimberling_, May 09 2017