Cody

# Problem 21. Return the 3n+1 sequence for n

Solution 2064110

Submitted on 19 Dec 2019 by Laura Gialloreto
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
n = 1; c_correct = 1; assert(isequal(collatz(n),c_correct))

2   Pass
n = 2; c_correct = [2 1]; assert(isequal(collatz(n),c_correct))

c = 2 1 k = 3

3   Pass
n = 5; c_correct = [5 16 8 4 2 1]; assert(isequal(collatz(n),c_correct))

c = 5 16 k = 3 c = 5 16 8 k = 4 c = 5 16 8 4 k = 5 c = 5 16 8 4 2 k = 6 c = 5 16 8 4 2 1 k = 7

4   Pass
n = 22; c_correct = [22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1]; assert(isequal(collatz(n),c_correct))

c = 22 11 k = 3 c = 22 11 34 k = 4 c = 22 11 34 17 k = 5 c = 22 11 34 17 52 k = 6 c = 22 11 34 17 52 26 k = 7 c = 22 11 34 17 52 26 13 k = 8 c = 22 11 34 17 52 26 13 40 k = 9 c = 22 11 34 17 52 26 13 40 20 k = 10 c = 22 11 34 17 52 26 13 40 20 10 k = 11 c = 22 11 34 17 52 26 13 40 20 10 5 k = 12 c = 22 11 34 17 52 26 13 40 20 10 5 16 k = 13 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 k = 14 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 k = 15 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 k = 16 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 k = 17