Fibonacci Sequence 🟡

In the Fibonacci sequence each number is the sum of the two preceding ones. Starting from 0, the first 20 terms in the Fibonacci Sequence are:

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

The Fibonacci numbers may be defined by:

\[ F_0 = 0, \qquad F_1 = 1, \qquad \text{and} \qquad F_n = F_{n-1} + F_{n-2} \]

Write a function that returns a Fibonacci sequence of N elements.

Useful Links

• Fibonacci sequence

• List

• If statements & Conditionals

• Functions

Content

• Write your code: Fibonacci
• Solution: Fibonacci