Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Sep 07 2014 08:07:29
%S 0,1,1,3,2,3,5,7,4,5,6,7,10,11,13,15,8,9,10,11,12,13,14,15,20,21,22,
%T 23,26,27,29,31,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,40,41,
%U 42,43,44,45,46,47,52,53,54,55,58,59,61,63,32,33,34,35,36
%N Smallest number that can be obtained by swapping 2 adjacent bits in the binary expansion of n.
%C Scanning from the left, find first occurrence of '10' in binary expansion and replace with '01' and return decimal representation or return n if no such swap exists. - _Chai Wah Wu_, Sep 06 2014
%H Alois P. Heinz, <a href="/A246592/b246592.txt">Table of n, a(n) for n = 0..10000</a>
%e If n = 9 = 1001_2 then a(9) = 0101_2 = 5.
%o (Python)
%o def A246592(n):
%o ....s = bin(n)[2:]
%o ....for i in range(len(s)-1):
%o ........if s[i:i+2] == '10':
%o ............return int(s[:i]+'01'+s[i+2:], 2)
%o ....else:
%o ........return n # _Chai Wah Wu_, Sep 06 2014
%Y Cf. A241816, A246591, A246593, A246594.
%K nonn,base
%O 0,4
%A _N. J. A. Sloane_, Sep 03 2014
%E More terms from _Alois P. Heinz_, Sep 03 2014