|
%I #4 Jun 25 2017 23:02:02
%S 3,7,10,14,17,20,24,27,31,34,37,41,44,48,51,55,58,61,65,68,72,75,78,
%T 82,85,89,92,96,99,102,106,109,113,116,119,123,126,130,133,136,140,
%U 143,147,150,154,157,160,164,167,171,174,177,181,184,188,191,195,198
%N Positions of 1 in A288997; complement of A288998.
%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="/A288999/b288999.txt">Table of n, a(n) for n = 1..10000</a>
%t z = 10; (* number of iterates *)
%t s = {0, 0}; w[0] = StringJoin[Map[ToString, s]];
%t w[n_] := StringReplace[w[n - 1], {"00" -> "0010", "01" -> "001", "10" -> "001"}]
%t TableForm[Table[w[n], {n, 0, 10}]]
%t st = ToCharacterCode[w[z]] - 48 (* A288997 *)
%t Flatten[Position[st, 0]] (* A288998 *)
%t Flatten[Position[st, 1]] (* A288999 *)
%Y Cf. A288997, A288998.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Jun 25 2017
|
