Cody

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

Solution 1595107

Submitted on 29 Jul 2018 by Hans Hudyncia
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

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

c = 2 odd = 0 c = 2 1

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

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

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