Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.

A241049

Smallest number k such that sopf(k)/digsum(k) = prime(n) where sopf(k) is the sum of the distinct primes dividing k and digsum(k) the sum of digits of k.

Terms

    a(0) =42a(1) =104a(2) =130a(3) =10a(4) =212a(5) =1336a(6) =1630a(7) =1003a(8) =1556a(9) =3122a(10) =2455a(11) =5298a(12) =9105a(13) =13842a(14) =3241a(15) =5230a(16) =10020a(17) =8754a(18) =11671a(19) =10104a(20) =16305a(21) =13141a(22) =7628a(23) =12786a(24) =16201a(25) =2012a(26) =18007a(27) =10630a(28) =11965a(29) =12607

External references