Problem 55990. Next Tribonacci Number

• Created by Ben Placek
• Appears in Matrix Manipulation II

×

Like (4)

Difficulty:

(18)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

56.5% Correct | 43.5% Incorrect

• 246 Solutions
• 129 Solvers

Last Solution submitted on Apr 05, 2025

Last 200 Solutions

Solution Comments

ANNOUNCEMENT ×

Registration Now Open for MathWorks AUTOMOTIVE CONFERENCE 2025

Hello Community, We're excited to announce that registration is now open for the...

Problem Recent Solvers129

Suggested Problems

• Interpolator

  3382 Solvers

• Set the array elements whose value is 13 to 0

  1381 Solvers

• Create a vector whose elements depend on the previous element

  714 Solvers

• Calculate Parallel Resistance

  590 Solvers

• Power Outages Histogram

  151 Solvers

More from this Author12

• Interpolated Value Between Two Points

  108 Solvers

• Extract the Acrostic Message

  103 Solvers

• Boustrophedon

  108 Solvers

• Generate Pascal's Triangle Matrix

  125 Solvers

• Create an arrow matrix

  442 Solvers