/prog/ Challenge

Hey, I've stolen this challenge from some website, it's pretty easy but I know most of you will fuck it up.

A sequence is defined by:

n -> n/2 (n is even)
n -> 3n + 1 (n is odd)

Find the longest sequence, with a starting number under one million.

Bonus points when you find the solution for ten million.

>>39
That hardly explains it. If we disable the memoization in the pythonfag's example, we get:

$ time python 23.py > /dev/null
real    2m40.108s
user    1m55.251s
sys    0m1.248s