Recurrence Relationshard
0:00.0

A Tribonacci-like recurrence is defined by an=an1+an2+2an3a_n = a_{n-1} + a_{n-2} + 2a_{n-3} with initial conditions a0=1,a1=3,a2=5a_0 = 1, a_1 = 3, a_2 = 5. Compute a4a_4.