math
posted by Reiny .
There is no function equation for the Fibonacci numbers, you have to use a Recursion formula.
F(n) = F(n1) + F(n2) for n>2 and F(1)=1, F(2)=1
what is the equation for the fibonacci sequence
Respond to this Question
Similar Questions

Math
F25= 75,025 and F26= 121,393 where Fn is the nth term in the Fibonacci sequence. Find F27. I do not understand the Fibonacci sequence, could someone help me with my question and explain it to me please. 
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 19 in using the … 
PreCalc
Find three examples of the Fibonacci sequence in nature. Write a paragraph for each example. For each example, address the following questions: How does the example relate to the Fibonacci sequence? 
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 can … 
Fibonacci Numbers
This is not a test question, but I did not know what the appropriate topic for my question is. If I used the terms 2, 3, 4, 8 consecutive terms of the Fibonacci sequence. "a" is the first and fourth terms and "b" is twice the product … 
Fibonacci sequence
The Fibonacci sequence a1=1,a2=1,a3=2,a4=3,a5=5,a6=8… is defined recursively using the formulas a1=a2=1 and an+2=an+an+1 for all n≥1. Find the greatest common divisor of a484 and a2013. 
Math (fibonacci
A sequence of numbers is called a Fibonaccitype 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 … 
Maths
A superFibonacci 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 superFibonacci sequences with 1 involve … 
Fibonacci Sequence
The sequence < un > is defined by the recurrence Un+1 = 3Un+1\5Un+3 initial condition of u1 = 1: Need to show un in terms of Fibonacci / Lucas numbers 
Maths
The Fibonacci sequence 1, 1, 2, 3, 5, 8, 13, 21, ... starts with two 1s, and each term afterwards is the sum of its two predecessors. Which one of the ten digits is the last to appear in the units position of a number in the Fibonacci …