login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A247600
Least positive integer m with pi(m*n) = m + n, where pi(x) denotes the number of primes not exceeding x.
11
9, 7, 6, 998, 5, 5, 5, 5, 5, 5, 636787, 1617099, 4124188, 10553076, 5, 5, 179992154, 465769460, 1208198239, 3140421185, 5, 5, 5, 145935688930, 5, 5, 5, 5, 5, 5, 5, 5, 5
OFFSET
5,1
COMMENTS
The author proved that a(n) exists for every n >= 5.
a(39) = a(41) = 5. - Chai Wah Wu, Jun 06 2024
LINKS
Zhi-Wei Sun, A new theorem on the prime-counting function, arXiv:1409.5685 [math.NT], 2014-2017.
EXAMPLE
a(5) = 9 since pi(5*9) = 14 = 5 + 9, and pi(5*m) = 5 + m for no m < 9.
MATHEMATICA
Do[m=1; Label[aa]; If[PrimePi[n*m]==m+n, Print[n, " ", m]; Goto[bb]]; m=m+1; Goto[aa]; Label[bb]; Continue, {n, 5, 21}]
Table[m = 1; While[PrimePi[m*n] != m + n, m++]; m, {n, 5, 14}] (* Robert Price, Mar 20 2019 *)
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Zhi-Wei Sun, Sep 21 2014
EXTENSIONS
a(22)-a(37) from Chai Wah Wu, May 03 2018
STATUS
approved