Write a code which returns the Fibonacci Sequence such that the largest value in the sequence is less than the input integer N. For example,
>> fib_seq(34)
ans =
1 1 2 3 5 8 13 21
>> fib_seq(35)
ans =
1 1 2 3 5 8 13 21 34
Solution Stats
Problem Comments
2 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers1507
Suggested Problems
-
Sum all integers from 1 to 2^n
17515 Solvers
-
569 Solvers
-
Square Digits Number Chain Terminal Value (Inspired by Project Euler Problem 92)
256 Solvers
-
925 Solvers
-
488 Solvers
More from this Author6
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Put the 34 and 35 cases into the test suite, as some of the current solutions still give 34 as part of the output for fib_seq(34)
Those test cases have been added.