The "Tribonacci" sequence is an extension of the idea of the Fibonacci sequence:
That is, each new term is the sum of the three previous terms.
The first 10 Tribonacci numbers are: 0, 1, 1, 2, 4, 7, 13, 24, 44, 81.
Given a value N, find the smallest Tribonacci number greater than N. You can assume N is a positive integer.
For example, if N = 42, your function should return 44. If N = 17, your function should return 24.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers171
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1335 Solvers
-
Create a vector whose elements depend on the previous element
808 Solvers
-
Mysterious digits operation (easy)
332 Solvers
-
683 Solvers
-
Interpolated Value Between Two Points
149 Solvers
More from this Author12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
