1132436852

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=37A000073
• a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073.at n=18A073717
• a(n) = T(3n+1), where T(n) are tribonacci numbers A000073.at n=12A074581
• Tribonacci numbers which can be written in the form a^2 + b^2.at n=14A216670
• Inverse Moebius transform of tribonacci numbers (A000073).at n=36A357238