%I #4 May 10 2017 17:48:24
%S 2,3,8,9,13,15,20,22,26,27,32,33,37,39,43,44,49,51,56,57,61,63,68,70,
%T 74,75,80,82,87,88,92,94,98,99,104,105,109,111,116,118,122,123,128,
%U 129,133,135,139,140,145,147,152,153,157,159,163,164,169,170,174
%N Positions of 1 in A284789; complement of A284790.
%C a(n) - a(n-1) is in {1,2,4,5} for n>=2. Conjecture: a(n)/n -> 3.
%H Clark Kimberling, <a href="/A284791/b284791.txt">Table of n, a(n) for n = 1..10000</a>
%e As a word, A284789 = 0110000110001010..., in which 1 is in positions 2,3,8,9,13,...
%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {1, 0}}] &, {0}, 9] (* A010060 *)
%t w = StringJoin[Map[ToString, s]]
%t w1 = StringReplace[w, {"1001" -> "0"}]
%t st = ToCharacterCode[w1] - 48 (* A284789 *)
%t Flatten[Position[st, 0]] (* A284790 *)
%t Flatten[Position[st, 1]] (* A284791 *)
%Y Cf. A010060, A284789, A284790.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, May 10 2017