## Fibonacci numbers¶

The Fibonacci numbers are defined recursively by the following difference equation:

\begin{equation}
\left\{
\begin{aligned}
F_{n} & = F_{n-1} + F_{n-2} \\
F_1 & = 1 \\
F_0 & = 0 \\
\end{aligned}
\right.
\end{equation}

It is easy to compute the first few elements in the sequence:

$0, 1, 1, 2, 3, 5, 8, 13, 21, 34 \cdots $