Smallest number that takes n steps to reach 1 under iteration of sum-of-squares-of-digits map (= smallest "happy number" of height n).
A001273
Smallest number that takes n steps to reach 1 under iteration of sum-of-squares-of-digits map (= smallest "happy number" of height n).
Terms
- a(0) =1a(1) =10a(2) =13a(3) =23a(4) =19a(5) =7a(6) =356a(7) =78999
External references
- oeis: A001273