Smallest number that requires n iterations of the sum of digits of the divisors (A034690) to reach 15.
A094501
Smallest number that requires n iterations of the sum of digits of the divisors (A034690) to reach 15.
Terms
- a(0) =15a(1) =8a(2) =7a(3) =4a(4) =3a(5) =2a(6) =19a(7) =12a(8) =6a(9) =5a(10) =13a(11) =9a(12) =10a(13) =16a(14) =30a(15) =18a(16) =34a(17) =36a(18) =66a(19) =162a(20) =924a(21) =71820a(22) =127005777360
External references
- oeis: A094501