If my over-use of str2num has in any way caused offense, I hereby beg leave to apologize.
My hat's off to you for such a solution. I'm baffled as to how to decode it (pun intended). I know that there has been a lot of furor over the use of regexp and other string-based functions, conversions, etc. to lower solution sizes for problems in general, but this problem is string-based, so I see no problem in solving it via arcane string methods.
Return the 3n+1 sequence for n
6288 Solvers
Maximum running product for a string of numbers
1151 Solvers
291 Solvers
232 Solvers
63 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!