|
%I
%S 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 55,56,57,58,59,60,61,62,63,96,97,98,99,100,101,102,103,104,105,106,
%U 107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122
%N Binary expansion does not begin 10.
%C For n>=1 sequence {a(n+1)} is the minimal recursive such that A007814(a(n+1))=A007814(n). [From _Vladimir Shevelev_, Apr 27 2009]
%C A053645(a(n)) = n-1 for n>0. [From _Reinhard Zumkeller_, May 20 2009]
%H 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_, Apr 15 2009]
%F For n>0, a(n) = 3n - 2 - A006257(n-1). - _Ralf Stephan_, Sep 16 2003
%F a(0) = 0, a(1) = 1, for n>0: a(2n) = 2*a(n) + 1, a(2n+1) = 2*a(n+1) . - _Philippe Deléham_, Feb 29 2004
%F For n>=2, A007814(a(n))=A007814(n-1). [From _Vladimir Shevelev_, Apr 15 2009]
%F a(n+2)=min{m>a(n+1): A007814(m)=A007814(n+2)}; A010060(a(n+1))= 1-A010060(n). [From _Vladimir Shevelev_, Apr 27 2009]
%o (PARI) is(n)=n<2 || binary(n)[2] \\ _Charles R Greathouse IV_, Sep 23 2012
%o (PARI) print1("0, 1");for(i=0,5,for(n=3<<i,(4<<i)-1,print1(", "n))) \\ _Charles R Greathouse IV_, Sep 23 2012
%Y Cf. A007814, A010060, A159559, A159560, A159615, A159619, A159629, A159698, A004759.
%K nonn,easy
%O 0,3
%A _N. J. A. Sloane_.
|
