Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Recurrence Relationshard
0:00.0

A Tribonacci-like recurrence is defined by an=an−1+an−2+2an−3a_n = a_{n-1} + a_{n-2} + 2a_{n-3}an​=an−1​+an−2​+2an−3​ with initial conditions a0=1,a1=3,a2=5a_0 = 1, a_1 = 3, a_2 = 5a0​=1,a1​=3,a2​=5. Compute a4a_4a4​.