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

  1. 👍 0
  2. 👎 0
  3. 👁 105
asked by Reiny
  1. Actually, there are a number of closed forms for Fn, but they are usually complicated. For example, Fn =

    ∑ (n-k-1)Ck

    where nCk is the combinations of n things k at a time


    ((1+√5)^n - (1-√5)^n)/(2^n √5)

Respond to this Question

First Name

Your Response

Similar Questions

  1. math

    what is the factorial of a negative number? The factorial function has singularities at the negative integers. You can see this as follows. For integers we define: (n+1)! = (n+1)n! and we put 0! = 1 So, from 0! you can compute 1!

    asked by chris on July 10, 2007
  2. Math (fibonacci

    A sequence of numbers is called a Fibonacci-type sequence if each number (after for the first two) is the sum of the two numbers which precede it. For example, 1, 1, 2, 3, 5, 8 ... is a Fibonacci- type sequence. If 1985, x, y, 200

    asked by Lexmo on August 8, 2014
  3. Fibonacci numbers

    I have three problems to answer dealing with Fibonacci numbers. I understand the first two, but would like for reassurrance that they are correct and lost on the last one and could use some help. Thank you. 1. Fibonacci numbers

    asked by Jennifer on October 2, 2011
  4. Pre-Cal

    Recursive Sequences: find a formula for: 1,1,2,3,5,8,13,21 It looks like the Fibonacci sequence. Take the first two numbers and add them to get the 3rd. take the 2nd and third to get the fourth...etc. yeah, but how would i write

    asked by James on December 6, 2006
  5. Math

    I cannot solve this pattern! 1,1,4,3,9,6,16,10,25,15 HINT: two different patterns are intertwined BIGGER HINT: only look at every other number This is a conjured up sequence not identifiable by any recursion formula. The first

    asked by Lin on August 25, 2006
  6. Math

    Hey can you please explain Fibonacci numbers in the simplest way possible because I really don't get them. Like i know the sequence goes 1,1,2,3,5,8,13,21, etc...But we have to fill in a table by plugging the numbers 1-9 in using

    asked by Jon on February 8, 2011
  7. Maths

    I have a summation formula for Fibonacci numbers. n (SUM)F(2i)=F(2n+1)-1 i=0 When the i value is changed from zero, and is then subbed into F(2i)the equation will not work. (RHS wont = LHS) eg: i=2 n=3 3 (SUM)F(4)=F(7)-1 i=2 I

    asked by Tim on November 4, 2008
  8. math

    1. Provide two examples of a function: (1) as a table of values and (2) as a graph. Explain the definition of a function. Be sure to include mathematical vocabulary in your response. 2. In a paragraph, explain what the domain and

    asked by lola on April 29, 2019
  9. bole seniour school

    construct flow chart for generating the nth fibonacci serious using two seed numbers read from the user input two seed number lengthe of the fibonacci serious

    asked by menebr on June 23, 2009
  10. Maths

    A super-Fibonacci sequence is a list of whole numbers with the property that, from the third term onwards, every term is the sum of all the previous terms. For example, 1, 4, 5, 10, ... How many super-Fibonacci sequences with 1

    asked by Palmer on November 16, 2016

More Similar Questions