Posted by **Reiny** on Sunday, March 11, 2007 at 9:55pm.

There is no function equation for the Fibonacci numbers, you have to use a Recursion formula.

F(n) = F(n-1) + F(n-2) for n>2 and F(1)=1, F(2)=1

what is the equation for the fibonacci sequence

## Answer This Question

## Related Questions

- Math (fibonacci - A sequence of numbers is called a Fibonacci-type sequence if ...
- Fibonacci Sequence - The sequence < un > is defined by the recurrence Un+1...
- Fibonacci numbers - I have three problems to answer dealing with Fibonacci ...
- Math - F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci ...
- Fibonacci sequence - The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8… is ...
- Fibonacci Numbers - This is not a test question, but I did not know what the ...
- Pre-Calc - Find three examples of the Fibonacci sequence in nature. Write a ...
- Math - Hey can you please explain Fibonacci numbers in the simplest way possible...
- Maths - The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ... starts with two 1s...
- Maths - A super-Fibonacci sequence is a list of whole numbers with the property ...

More Related Questions