Define f(k) = floor(k/ sum of the digits of k). Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.
A080462
Define f(k) = floor(k/ sum of the digits of k). Let f(f(...(n))) = m where m is divisible by the sum of the digits of m. Then a(n)= one more than the least number of steps to obtain m.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =2a(11) =1a(12) =2a(13) =2a(14) =2a(15) =2a(16) =2a(17) =1a(18) =2a(19) =1a(20) =1a(21) =2a(22) =2a(23) =1a(24) =2a(25) =2a(26) =1a(27) =2a(28) =2a(29) =1
External references
- oeis: A080462