Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15.

A094450

Number of iterations of the sum of digits of the divisors of 10^n needed to reach 15.

Terms

    a(0) =12a(1) =10a(2) =16a(3) =15a(4) =3a(5) =11a(6) =4a(7) =13a(8) =6a(9) =6a(10) =5a(11) =19a(12) =16a(13) =3a(14) =11a(15) =13a(16) =19a(17) =7a(18) =5a(19) =9a(20) =6a(21) =16a(22) =16a(23) =19a(24) =5a(25) =3a(26) =12a(27) =3a(28) =18a(29) =16

External references