Smallest m such that {n+k*(n-1): 0<k<=m} contains exactly as many primes as <= n.

A088573

Smallest m such that {n+k*(n-1): 0<k<=m} contains exactly as many primes as <= n.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =6a(5) =7a(6) =5a(7) =15a(8) =10a(9) =11a(10) =9a(11) =29a(12) =12a(13) =33a(14) =13a(15) =15a(16) =21a(17) =35a(18) =14a(19) =57a(20) =20a(21) =25a(22) =27a(23) =43a(24) =18a(25) =45a(26) =22a(27) =29a(28) =26a(29) =59

External references