Return to Question

A positive integer N is K-sparse if there are at least K 0s between any two consecutive 1s in its binary representation.

So, the number 1010101 is 1-sparse whereas 101101 is not.

Your task is to find the next 1-sparse number for the given input number. For example, if the input is 12 (0b1100) output should be 16 (0b10000) and if the input is 18 (0b10010) output should be 20 (0b10100).

Smallest program (bytes) wins! Standard loopholes disallowed.

A positive integer N is K-sparse if there are at least K 0s between any two consecutive 1s in its binary representation.

So, the number 1010101 is 1-sparse whereas 101101 is not.

Your task is to find the next 1-sparse number for the given input number. For example, if the input is 12 (0b1100) output should be 16 (0b10000) and if the input is 18 (0b10010) output should be 20 (0b10100).

Smallest program or function (in bytes) wins! Standard loopholes disallowed.

A positive integer N is called K-sparse if there are at least K 0s between any two consecutive 1s in its binary representation. So, the number 1010101 is 1-sparse whereas 101101 is not. Your task is to find the next 1-sparse number for the given input number. For eg. if the input is 12(1100) output should be 16(10000) and if the input is 18(10010) output should be 20(10100).

Shortest number of bytes wins. Standard loopholes disallowed!

A positive integer N is K-sparse if there are at least K 0s between any two consecutive 1s in its binary representation. 

So, the number 1010101 is 1-sparse whereas 101101 is not. 

Your task is to find the next 1-sparse number for the given input number. For example, if the input is 12 (0b1100) output should be 16 (0b10000) and if the input is 18 (0b10010) output should be 20 (0b10100).

Smallest program (bytes) wins! Standard loopholes disallowed.