%I A079256
%S A079256 1,2,5,6,8,16,17,32,33,34,35,36,37,38,39,64,128,129,130,131,132,133,
%T A079256 134,135,136,137,138,139,140,141,142,256,512,1024,2048,4096,8192,16384,
%U A079256 32768,32769,32770,32771,32772,32773,32774,32775,32776,32777,32778
%N A079256 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 A079256 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 A079256 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)
%Y A079256 See A079000, A079253, A079254 for similar sequences.
%Y A079256 Sequence in context: A019989 A045547 A127143 this_sequence A097685 A136369 
               A007573
%Y A079256 Adjacent sequences: A079253 A079254 A079255 this_sequence A079257 A079258 
               A079259
%K A079256 nonn,easy
%O A079256 1,2
%A A079256 N. J. A. Sloane (njas(AT)research.att.com) and Matthew Vandermast (ghodges14(AT)comcast.net), 
               Feb 04 2003