Find the next 1-sparse binary number
Pyth, 9 bytes

Borrowing the x &amp; (x*2) != 0 algorithm from @alephalpha
Borrowing Pyth boilerplate from @Jakube

My first attempt at Pyth:
f!.&amp;TyThQ

Try it here
               implicit: Q = input()            
f      hQ      find the first integer T &gt;= Q + 1, 
               that satisfies the condition:
 !.&amp;TyT        T &amp; (T * 2) is 0