%I A004760
%S A004760 0,1,3,6,7,12,13,14,15,24,25,26,27,28,29,30,31,48,49,50,51,52,53,54,
%T A004760 55,56,57,58,59,60,61,62,63,96,97,98,99,100,101,102,103,104,105,106,
%U A004760 107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122
%N A004760 Binary expansion does not begin 10.
%C A004760 For n>=1 sequence {a(n+1)} is the minimal recursive such that A007814(a(n+1))=A007814(n). 
               [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 27 2009]
%C A004760 A053645(a(n)) = n-1 for n>0 . [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               May 20 2009]
%H A004760 V. Shevelev, <a href="http://arXiv.org/abs/0904.2101">Several results 
               on sequences which are similar to the positive integers</a> [From 
               Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 15 2009]
%F A004760 For n>0, a(n) = 3n - 2 - A006257(n-1). - Ralf Stephan (ralf(AT)ark.in-berlin.de), 
               Sep 16 2003
%F A004760 a(0) = 0, a(1) = 1, for n>0: a(2n) = 2*a(n) + 1, a(2n+1) = 2*a(n+1) . 
               - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 29 2004
%F A004760 For n>=2, A007814(a(n))=A007814(n-1). [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), 
               Apr 15 2009]
%F A004760 a(n+2)=min{m>a(n+1): A007814(m)=A007814(n+2)}; A010060(a(n+1))= 1-A010060(n). 
               [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 27 2009]
%Y A004760 Cf. A007814 A010060 A159559 A159560 A159615 A159619 A159629 A159698 A004759 
               [From Vladimir Shevelev (shevelev(AT)bgu.ac.il), Apr 23 2009]
%Y A004760 Sequence in context: A028802 A141742 A004755 this_sequence A093906 A152829 
               A104463
%Y A004760 Adjacent sequences: A004757 A004758 A004759 this_sequence A004761 A004762 
               A004763
%K A004760 nonn
%O A004760 0,3
%A A004760 N. J. A. Sloane (njas(AT)research.att.com).