Question

One of the most famous sequences is the Fibonacci sequence:

1, 1, 2, 3, 5, 8, 13, 21, 34, ….
f(n + 1) = f(n) + f(n − 1), where f(1) = 1, f(2) = 1, and n ≥ 2.
How is each term of the sequence generated?

Answer 1

Each term is generated by adding the two terms before it