Cody

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

Solution 1661741

Submitted on 29 Oct 2018 by Hakan Ayral
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))

q = 1 c = 2 1

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

q = 16 c = 5 16 q = 8 c = 5 16 8 q = 4 c = 5 16 8 4 q = 2 c = 5 16 8 4 2 q = 1 c = 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))

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