swap adjacent bits by KrausRaus

for(i=-1;++i<100;print(parseInt(o,2)))for(j in(b=i.toString(2,o="")).length%2?b=0+b:b)j%2?o+=b[j]+b[j-1]:0

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page