Cody

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

Solution 1599110

Submitted on 3 Aug 2018 by Ashish Patil
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))

i = 2 c = 2 1

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

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

i = 2 c = 22 11 i = 3 c = 22 11 34 i = 4 c = 22 11 34 17 i = 5 c = 22 11 34 17 52 i = 6 c = 22 11 34 17 52 26 i = 7 c = 22 11 34 17 52 26 13 i = 8 c = 22 11 34 17 52 26 13 40 i = 9 c = 22 11 34 17 52 26 13 40 20 i = 10 c = 22 11 34 17 52 26 13 40 20 10 i = 11 c = 22 11 34 17 52 26 13 40 20 10 5 i = 12 c = 22 11 34 17 52 26 13 40 20 10 5 16 i = 13 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 i = 14 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 i = 15 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 i = 16 c = 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1