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))
|
Find the alphabetic word product
2321 Solvers
2183 Solvers
482 Solvers
376 Solvers
856 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!