a(n) is the least integer k such that the sum of the prime divisors of k, each taken modulo its exponent in the prime factorization of k, equals n.
A391646
a(n) is the least integer k such that the sum of the prime divisors of k, each taken modulo its exponent in the prime factorization of k, equals n.
Terms
- a(0) =1a(1) =9a(2) =8a(3) =72a(4) =1000a(5) =648a(6) =16200a(7) =81000a(8) =1125000a(9) =38896200a(10) =10125000a(11) =496125000a(12) =3735591048a(13) =24310125000
External references
- oeis: A391646