Tribonacci Number — Definition, Formula & Examples
A Tribonacci number is a term in a sequence where each value equals the sum of the three terms before it, starting from 0, 0, 1. It extends the idea behind Fibonacci numbers by looking back three positions instead of two.
The Tribonacci sequence is defined by the recurrence relation for , with initial conditions , , and .
Key Formula
Where:
- = The nth Tribonacci number
- = Initial conditions that start the sequence
How It Works
To find the next Tribonacci number, add the three most recent terms together. The sequence begins 0, 0, 1, and every term after that is computed from the three before it. Because each term depends on three predecessors rather than two, Tribonacci numbers grow faster than Fibonacci numbers. The ratio of consecutive terms converges to the Tribonacci constant, approximately 1.8393.
Worked Example
Problem: Find the first 10 Tribonacci numbers (T₀ through T₉).
Initial values: Start with the given seeds.
Compute T₃ through T₅: Add the three preceding terms for each new entry.
Compute T₆ through T₉: Continue the same process.
Answer: The first 10 Tribonacci numbers are 0, 0, 1, 1, 2, 4, 7, 13, 24, 44.
Why It Matters
Tribonacci numbers appear in combinatorics problems that count arrangements with three choices at each step. They also show up in computer science algorithm analysis and in discrete math courses when studying higher-order linear recurrences.
Common Mistakes
Mistake: Using only two preceding terms instead of three (computing Fibonacci instead of Tribonacci).
Correction: Always sum the three most recent terms. For example, T₆ = T₅ + T₄ + T₃ = 4 + 2 + 1 = 7, not T₅ + T₄ = 6.
