Implementations of Happy Numbers
Simple recursive version that stores the previous steps in the sequence in an array, and checks for duplicates to detect cycles.
Can get up to 250,000,000 numbers in ~5s, with no memoisation:
$ time ./happy_numbers 350000000