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 state names that end with the letter A
707 Solvers
Given an unsigned integer x, find the largest y by rearranging the bits in x
780 Solvers
Make one big string out of two smaller strings
1148 Solvers
Choose the best fitting dominoes
171 Solvers
140 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!