This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 0;
y_correct = 1;
assert(isequal(Belln(n),y_correct))
|
2 | Pass |
n = 5;
y_correct = [1 1 2 5 15 52];
assert(isequal(Belln(n),y_correct))
|
3 | Pass |
n = 9;
y_correct = [1 1 2 5 15 52 203 877 4140 21147];
assert(isequal(Belln(n),y_correct))
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
35553 Solvers
739 Solvers
188 Solvers
Project Euler: Problem 5, Smallest multiple
397 Solvers
Longest run of consecutive numbers
1648 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!