%I #8 Nov 23 2024 00:28:45
%S 3,5,6,9,10,12,13,16,18,19,21,22,25,26,28,29,32,34,35,38,39,41,42,45,
%T 46,48,49,52,54,55,57,58,61,62,64,65,68,70,71,74,75,77,78,81,83,84,86,
%U 87,90,91,93,94,97,99,100,102,103,106,107,109,110,113,115
%N Positions of 1 in A286059; complement of A286060.
%C Conjecture: lim_{n->oo} a(n)/n = 1.80..., and if m denotes this number, then -2 < a(n)/n - m < 1 for n >= 1.
%H Clark Kimberling, <a href="/A286061/b286061.txt">Table of n, a(n) for n = 1..10000</a>
%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];
%t w[n_] := StringReplace[w[n - 1], {"00" -> "001", "1" -> "011"}]
%t Table[w[n], {n, 0, 8}]
%t st = ToCharacterCode[w[11]] - 48 (* A286059 *)
%t Flatten[Position[st, 0]] (* A286060 *)
%t Flatten[Position[st, 1]] (* A286061 *)
%t Table[StringLength[w[n]], {n, 1, 35}] (* A286062 conjectured *)
%Y Cf. A286059, A286060.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Jun 05 2017