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
1997 Solvers
559 Solvers
Count from 0 to N^M in base N.
200 Solvers
Back to basics 3 - Temp Directory
277 Solvers
367 Solvers