Question
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
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
Answers
Actually, there are a number of closed forms for Fn, but they are usually complicated. For example, Fn =
floor((n-1)/2)
∑ (n-k-1)Ck
k=0
where nCk is the combinations of n things k at a time
or
((1+√5)^n - (1-√5)^n)/(2^n √5)
floor((n-1)/2)
∑ (n-k-1)Ck
k=0
where nCk is the combinations of n things k at a time
or
((1+√5)^n - (1-√5)^n)/(2^n √5)
Related Questions
Recursive Sequences:
find a formula for:
1,1,2,3,5,8,13,21
It looks like the Fibonacci sequen...
I have a summation formula for Fibonacci numbers.
n
(SUM)F(2i)=F(2n+1)-1
i=0
When the i...
I have three problems to answer dealing with Fibonacci numbers. I understand the first two, but woul...
What is the most appropriate structure for handling code that is repeated multiple times in a progra...