The Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, ... They are defined recursively by the formula f1=1, f2=1, fn= fn-1 + fn-2 for n>=3.
