a(n) is the smallest number k such that digsum(k)/tau(k) = prime(n) where tau(k) is the number of divisors of k and digsum(k) is the sum of the digits of k.

A240915

a(n) is the smallest number k such that digsum(k)/tau(k) = prime(n) where tau(k) is the number of divisors of k and digsum(k) is the sum of the digits of k.

Terms

    a(0) =8a(1) =9a(2) =19a(3) =59a(4) =499a(5) =1889a(6) =17989a(7) =39989a(8) =199999a(9) =4999999a(10) =9899999a(11) =389999999a(12) =9199999999a(13) =9959999999a(14) =99499999999a(15) =899999998999

External references