|
%I #10 Mar 21 2019 09:41:08
%S 1,2,5,6,8,16,17,32,33,34,35,36,37,38,39,64,128,129,130,131,132,133,
%T 134,135,136,137,138,139,140,141,142,256,512,1024,2048,4096,8192,
%U 16384,32768,32769,32770,32771,32772,32773,32774,32775,32776,32777,32778
%N a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2".
%H Robert Israel, <a href="/A079256/b079256.txt">Table of n, a(n) for n = 1..10000</a>
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">Numerical analogues of Aronson's sequence</a>, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
%H B. Cloitre, N. J. A. Sloane and M. J. Vandermast, <a href="http://arXiv.org/abs/math.NT/0305308">Numerical analogues of Aronson's sequence</a> (math.NT/0305308)
%p A:= Vector(100):
%p A[1..5]:= <1,2,5,6,8>:
%p going:= true;
%p for n from 3 while going do
%p for k from 0 to A[n+1]-A[n] do
%p if A[n]+k > 100 then going:= false; break fi;
%p A[A[n]+k]:= 2^n+k
%p od od:
%p convert(A,list); # _Robert Israel_, Mar 20 2019
%Y See A079000, A079253, A079254 for similar sequences.
%K nonn,easy
%O 1,2
%A _N. J. A. Sloane_ and _Matthew Vandermast_, Feb 04 2003
|
