The Fibonacci Sequence

The below calculator displays the first n numbers (0 is not counted) in the Fibonacci Sequence of Numbers where n is entered by the user.  This is very processor intensive, do not enter a number greater than 30 (25 on older computers).

The first two numbers in the Fibonacci Sequence are 0 and 1.  After these two starting values, every number is the sum of the two preceding numbers.

The sequence is defined recursively as: