Ononot — For the Fibonacci-like recurrence an = a{n-1} + a{n-2} with

Guest Session: 1 Question Remaining. Create Account to save progress.

Recurrence Relationseasy

0:00.0

For the Fibonacci-like recurrence $a_n = a_{n-1} + a_{n-2}$ with $a_0 = 1$ and $a_1 = 1$ , find $a_4$ .