Implement Fibonacci's number, then improve on your original design.
Sigiloso
I did the recursive method first, then added a look up table (via a Map) that would check to see if the number's solution was already found, if not it would find it then insert it into the table.