8646064

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=29A000073
• a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.at n=14A073717
• 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=28A075536
• Tribonacci(tetranacci(n)).at n=9A111427
• a(n) = 7*a(n-1) - 5*a(n-2) + a(n-3), with initial values a(0) = a(1) = 1, a(2)=4.at n=10A192806
• Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3).at n=27A282718
• Inverse Moebius transform of tribonacci numbers (A000073).at n=28A357238
• a(n) is the smallest tribonacci number (A000073) with exactly n distinct prime factors.at n=5A359848