Least integer m > 0 such that pi(m*n) divides prime(m) + prime(n), where pi(x) denotes the number of primes not exceeding x.

A247793

Least integer m > 0 such that pi(m*n) divides prime(m) + prime(n), where pi(x) denotes the number of primes not exceeding x.

Terms

    a(0) =2a(1) =1a(2) =75a(3) =10a(4) =18a(5) =1a(6) =75a(7) =41a(8) =58a(9) =2a(10) =94a(11) =107a(12) =14a(13) =13a(14) =2a(15) =14a(16) =14a(17) =1a(18) =84a(19) =527a(20) =124a(21) =715a(22) =13a(23) =4a(24) =1a(25) =4a(26) =276a(27) =310a(28) =2a(29) =4

External references