Cody

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

Solution 1181789

Submitted on 5 May 2017 by Jihye Sofia Seo
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))

n = 1 c = 2 1

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

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

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