Recursive Function by twobit

f n|n<3=n|n>2=f(n-1)*f(n-3)+1
main=print$f 35

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

download

return to the top page