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

The Tribonacci sequence satisfies Tn=Tn−1+Tn−2+Tn−3T_n = T_{n-1} + T_{n-2} + T_{n-3}Tn​=Tn−1​+Tn−2​+Tn−3​ with T0=0,T1=1,T2=1T_0 = 0, T_1 = 1, T_2 = 1T0​=0,T1​=1,T2​=1. Compute T6T_6T6​.