Fibonacci number

In mathematics, the Fibonacci numbers form a sequence defined recursively by:

Related Topics:
Mathematics - Sequence - Recursively

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

:

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

F_n := F(n):=

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

egin{cases}

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

0 & mbox{if } n = 0; \

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

1 & mbox{if } n = 1; \

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

F(n-1)+F(n-2) & mbox{if } n > 1. \

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

end{cases}

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

In other words: one starts with 0 and 1, and then produces the next Fibonacci number by adding the two previous Fibonacci numbers. The first Fibonacci numbers {{OEIS|id=A000045}}) for n = 0, 1, ... are

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, ?

Related Topics:
0 - 1 - 2 - 3 - 5 - 8 - 13 - 21 - 34 - 55 - 89 - 144

~ ~ ~ ~ ~ ~ ~ ~ ~ ~