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

a bit tricky but nice

I like this problem, because I learnt about the Collatz sequence story. Very interessting.

function c = collatz(n)
c(1) = n;
while (1>0)
if (n == 1)
c(end+1) = n;
break
elseif (mod(n,2) == 0)
c(end+1) = n;
n = n/2;
collatz(n);
else
c(end+1) = n;
n = 3*n + 1;
collatz(n);
end
end
c(1) = [];
end

This solution is correct as I ran the Test Cases myself. But the compiler timed out. What should I do ?