Is there a formula for the Fibonacci sequence?

Question

the Fibbonacci sequence is 1,1,2,3,5,8...

Answer 1

Everyone has already stated the regression formula: f_n=f_{n-1}+f_{n-2}, where f_0=f_1=1. Notice you need the preceding numbers to get the next number. You can also use Binet's formula to find the nth fibonaci formula without knowing the previous numbers. See the link below.

Answer 2

In mathematics, the Fibonacci numbers form a sequence defined by the following recurrence relation:
F(n) =0 when n=0
=1 when n=1
=F(n-1)+F(n-2) when n>1

Answer 3

if n=0 F(0) =0

if n=1 F(1) =1

and general F(n) = F(n-1) + F(n-2)

The fibonacci sequence says that a number if rank n is the sum of the two precedent nummbers

Answer 4

You have to work it out by hand because it's a recursive sequence which means that to find the nth term you need to know the n-1 and n-2 term. It's a pain in the butt.

Answer 5

You mean like a closed form expression? Yes; there is.

Let a = [1 + sqrt(5)]/2. The formula for the closed form is

a(n) = [a^n - (1 - a)^2] / 5

Answer 6

a(n)=a(n-1)+a(n-2)

Where n starts at 3

So a(3) = a(2) + a(1) = 1 + 1 =2

a(4) = a(2) + a(3) = 1 + 2 = 3

ie each number is the sum of the previous 2 numbers

Answer 7

Fn = ((Phi^n) - (-Phi^-n))/ sqrt(5)

where Phi = (1 + sqrt(5))/2