Smallest number that takes n steps to reach 1 under iteration of sum-of-squares-of-digits map (= smallest "happy number" of height n). 1, 10, 13, 23, 19, 7, 356, 7899
2 seqfan posts