The smallest number such that n or more numbers k exist with k - a(n) = sopfr(k) + sopfr(a(n)), where sopfr(m) is the sum of the primes dividing m with repetition.
A370352
The smallest number such that n or more numbers k exist with k - a(n) = sopfr(k) + sopfr(a(n)), where sopfr(m) is the sum of the primes dividing m with repetition.
Terms
- a(0) =1a(1) =1a(2) =6a(3) =22a(4) =46a(5) =526a(6) =838a(7) =838a(8) =5667a(9) =5667a(10) =20158a(11) =32127a(12) =56697a(13) =82617a(14) =174718a(15) =174718a(16) =314492a(17) =314492a(18) =415789a(19) =498957a(20) =1142398a(21) =1713598a(22) =1713598a(23) =2280067a(24) =2280067a(25) =4324316a(26) =4324316a(27) =5847653a(28) =6918908a(29) =6918908
External references
- oeis: A370352