|
%I #4 Jun 29 2017 14:55:49
%S 3,10,14,16,21,23,26,31,35,43,48,52,59,66,70,74,81,83,88,90,95,99,103,
%T 110,114,116,121,123,128,130,135,139,143,153,155,158,163,167,174,181,
%U 188,192,194,199,201,204,209,213,223,225,228,233,237,244,251,258
%N Positions of 1 in A289235; complement of A289002.
%C Conjecture: a(n)/n -> 1.56..., and if m denotes this number, then -1 < m - a(n)/n < 2 for n >= 1.
%H Clark Kimberling, <a href="/A289151/b289151.txt">Table of n, a(n) for n = 1..10000</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" -> "100", "10" -> "000"}]
%t TableForm[Table[w[n], {n, 0, 10}]]
%t st = ToCharacterCode[w[z]] - 48 (* A289235 *)
%t Flatten[Position[st, 0]] (* A289002 *)
%t Flatten[Position[st, 1]] (* A289151 *)
%Y Cf. A289235, A289002.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, Jun 29 2017
|
