An afaik unnamed involution by mitchs

n=0
while~99+n:n+=1;k=n^-n;print(n,':',2*len(bin(k))-9<<n//-k)

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