The Fibonacci sequence is a series of numbers in which each number is the sum of the two preceding ones, usually starting with 0 and 1.
The sequence goes like this: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, and so on.
The sequence can be defined recursively by the formula:
F(n) = F(n-1) + F(n-2)
Where F(0) = 0 and F(1) = 1.