3249569

Appears in sequences

• The smallest number such that exactly n numbers k exist such that a(n) - k = sopfr(a(n)) + sopfr(k), where sopfr(m) is the sum of the primes dividing m, with repetition.at n=25A370091