q=[];300.times{n->println r=q[n]=n<2?1:q[n-r]+q[n-q[n-2]]}

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

download

return to the top page