Fibonacci numbers
Description
A recurrence relation is an equation that recursively defines a sequence, once one or more initial terms are given: each further term of the sequence is defined as a function of the preceding terms.The Fibonacci numbers are the archetype of a linear, homogeneous recurrence relation with constant coefficients. Fo=0, F1=1
We obtain the sequence of Fibonacci numbers which begins:
Variables
| Fn | Fibonacci numbers (dimensionless) |
| F(n-1) | The n-1 number F(n-1) (F0=0) (F1=1) (dimensionless) |
| F(n-2) | The n-2 number F(n-2) (F2=1) (F3=2).... (dimensionless) |