|
%I #4 May 11 2017 20:11:33
%S 2,3,5,8,9,14,20,21,23,26,27,33,34,36,41,44,45,50,56,57,59,64,67,68,
%T 74,75,77,80,81,86,92,93,95,98,99,105,106,108,113,116,117,123,124,126,
%U 129,130,135,141,142,144,149,152,153,158,164,165,167,170,171,177
%N Positions of 1 in A286493; complement of A286494.
%C a(n) - a(n-1) is in {1,2,3,5,6} for n>=2. Conjecture: a(n)/n -> 3.
%H Clark Kimberling, <a href="/A286495/b286495.txt">Table of n, a(n) for n = 1..10000</a>
%e As a word, A286493 = 01101001100001000001..., in which 1 is in positions 2,3,5,8,9,14,...
%t s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {1, 0}}] &, {0}, 9] (* A010060 *)
%t w = StringJoin[Map[ToString, s]]
%t w1 = StringReplace[w, {"1011" -> "0"}]
%t st = ToCharacterCode[w1] - 48 (* A286493 *)
%t Flatten[Position[st, 0]] (* A286494 *)
%t Flatten[Position[st, 1]] (* A286495 *)
%Y Cf. A010060, A286493, A286494.
%K nonn,easy
%O 1,1
%A _Clark Kimberling_, May 11 2017
|
