Cody

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

Solution 1981368

Submitted on 18 Oct 2019 by Harsh Patel
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))

f = 1 n = 2 1

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

n = 5 16 f = 8 n = 5 16 8 f = 4 n = 5 16 8 4 f = 2 n = 5 16 8 4 2 f = 1 n = 5 16 8 4 2 1

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))

f = 11 n = 22 11 n = 22 11 34 f = 17 n = 22 11 34 17 n = 22 11 34 17 52 f = 26 n = 22 11 34 17 52 26 f = 13 n = 22 11 34 17 52 26 13 n = 22 11 34 17 52 26 13 40 f = 20 n = 22 11 34 17 52 26 13 40 20 f = 10 n = 22 11 34 17 52 26 13 40 20 10 f = 5 n = 22 11 34 17 52 26 13 40 20 10 5 n = 22 11 34 17 52 26 13 40 20 10 5 16 f = 8 n = 22 11 34 17 52 26 13 40 20 10 5 16 8 f = 4 n = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 f = 2 n = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 f = 1 n = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1