This equation generates a Fibonacci Sequence, a sequence of integer numbers defined by a function given below. The Fibonacci sequence is the integer sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ...
By definition, the first two numbers in the Fibonacci sequence are 0 and 1. Each subsequent number is the sum of the previous two numbers in the sequence: F(n) = F(n-1) + F(n-2).
n can be any positive integer.
This equation generates the sequence up to the nth term. vCalc limits total server processing time, so you will reach a limit of n here. In the future vCalc will provide additional server access time to users who request additional processing time.
There is an excellent TED talk by Arthur Benjamin on The magic of Fibonacci numbers which you should check out if you want to see some of the amazing things that can be created using the Fibonacci Series.