Cody

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

Solution 139141

Submitted on 14 Sep 2012 by José-Luis
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 = 2 1

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

n = 5 16 n = 5 16 8 n = 5 16 8 4 n = 5 16 8 4 2 n = 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 = 22 11 n = 22 11 34 n = 22 11 34 17 n = 22 11 34 17 52 n = 22 11 34 17 52 26 n = 22 11 34 17 52 26 13 n = 22 11 34 17 52 26 13 40 n = 22 11 34 17 52 26 13 40 20 n = 22 11 34 17 52 26 13 40 20 10 n = Columns 1 through 10 22 11 34 17 52 26 13 40 20 10 Column 11 5 n = Columns 1 through 10 22 11 34 17 52 26 13 40 20 10 Columns 11 through 12 5 16 n = Columns 1 through 10 22 11 34 17 52 26 13 40 20 10 Columns 11 through 13 5 16 8 n = Columns 1 through 10 22 11 34 17 52 26 13 40 20 10 Columns 11 through 14 5 16 8 4 n = Columns 1 through 10 22 11 34 17 52 26 13 40 20 10 Columns 11 through 15 5 16 8 4 2 n = Columns 1 through 10 22 11 34 17 52 26 13 40 20 10 Columns 11 through 16 5 16 8 4 2 1