Hofstadter Q sequence by teebee(inaniwa,I., S.)

Q[];p;r;main(i){for(;i<301;printf("%d\n",r=Q[i++]=i<3?:Q[p+1]+Q[p=i-r]));}

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

download

return to the top page