This page contains an implementation of the Fibonacci sequence algorithm. It uses tail recursion, which is a fancy way to say that it uses a static amount of memory (or, well, it would if JavaScript handled numbers sanely).
Type a number and click the button!