Cody

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

Solution 1697767

Submitted on 20 Dec 2018 by D S
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))

index = 0 term = 1 index = 1 c = 1

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

index = 0 term = 2 c = 2 index = 2 c = 2 1

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

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

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