A289027 - OEIS

%I #4 Jun 27 2017 21:37:27

%S 3,7,10,14,16,20,23,26,30,33,37,41,43,47,50,54,58,61,65,68,72,75,78,

%T 82,84,88,91,95,98,102,106,109,113,115,119,122,126,130,132,136,139,

%U 142,146,149,153,157,160,164,166,170,173,177,180,184,188,191,195,198

%N Positions of 1 in A289025; complement of A289026.

%C Conjecture:  a(n)/n -> 2 + sqrt(2), and -1 < 2 + sqrt(2) - a(n)/n < -1 + sqrt(2) for n >= 1.

%H Clark Kimberling, <a href="/A289027/b289027.txt">Table of n, a(n) for n = 1..10342</a>

%t z = 11; (* number of iterates *)

%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];

%t w[n_] := StringReplace[w[n - 1], {"00" -> "0010", "01" -> "010", "10" -> "001"}]

%t TableForm[Table[w[n], {n, 0, 10}]]

%t st = ToCharacterCode[w[z]] - 48   (* A289025 *)

%t Flatten[Position[st, 0]]  (* A289026 *)

%t Flatten[Position[st, 1]]  (* A289027 *)

%Y Cf. A289025, A289026.

%K nonn,easy

%O 1,1

%A _Clark Kimberling_, Jun 27 2017