a(n) is the smallest number such that exactly n 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.
A370356
a(n) is the smallest number such that exactly n 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) =4a(1) =1a(2) =6a(3) =22a(4) =46a(5) =526a(6) =1509a(7) =838a(8) =6238a(9) =5667a(10) =20158a(11) =32127a(12) =56697a(13) =82617a(14) =177598a(15) =174718a(16) =384382a(17) =314492a(18) =415789a(19) =498957a(20) =1142398a(21) =1884958a(22) =1713598a(23) =2620798a(24) =2280067a(25) =5209342a(26) =4324316a(27) =5847653a(28) =7796863a(29) =16516489
External references
- oeis: A370356