Cody

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

Solution 2011110

Submitted on 9 Nov 2019 by Jimmy Jing
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))

c = 1 x = 1

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

c = 2 x = 1 c = 2 1 x = 2

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

c = 5 x = 1 c = 5 16 x = 2 c = 5 16 8 x = 3 c = 5 16 8 4 x = 4 c = 5 16 8 4 2 x = 5 c = 5 16 8 4 2 1 x = 6

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 x = 1 c = 22 11 x = 2 c = 22 11 34 x = 3 c = 22 11 34 17 x = 4 c = 22 11 34 17 52 x = 5 c = 22 11 34 17 52 26 x = 6 c = 22 11 34 17 52 26 13 x = 7 c = 22 11 34 17 52 26 13 40 x = 8 c = 22 11 34 17 52 26 13 40 20 x = 9 c = 22 11 34 17 52 26 13 40 20 10 x = 10 c = 22 11 34 17 52 26 13 40 20 10 5 x = 11 c = 22 11 34 17 52 26 13 40 20 10 5 16 x = 12 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 x = 13 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 x = 14 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 x = 15 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1 x = 16