29249425

Appears in sequences

• Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.at n=31A000073
• a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.at n=15A073717
• a(n) = T(3n+1), where T(n) are tribonacci numbers A000073.at n=10A074581
• a(n) = ((1+(-1)^n)*T(n+1) + (1-(-1)^n)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644.at n=30A075536
• a(n) is the sum of the (1,2)- and (1,3)-entries of the matrix P^n + T^n, where the 3 X 3 matrices P and T are defined by P = [0,1,0; 0,0,1; 1,0,0] and T = [0,1,0; 0,0,1; 1,1,1].at n=30A109523
• Tribonacci(pentanacci(n)).at n=10A111428
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=29A282718
• Inverse Moebius transform of tribonacci numbers (A000073).at n=30A357238