For each n, let p(n,b) be the smallest prime in the arithmetic progression k*n+b, with k > 0. Then a(n) = max(p(n,b)) with 0 < b < n and gcd(b,n) = 1.

A085420

For each n, let p(n,b) be the smallest prime in the arithmetic progression k*n+b, with k > 0. Then a(n) = max(p(n,b)) with 0 < b < n and gcd(b,n) = 1.

Terms

    a(0) =2a(1) =3a(2) =7a(3) =7a(4) =19a(5) =11a(6) =29a(7) =23a(8) =43a(9) =19a(10) =71a(11) =23a(12) =103a(13) =53a(14) =43a(15) =43a(16) =103a(17) =53a(18) =191a(19) =59a(20) =97a(21) =79a(22) =233a(23) =73a(24) =269a(25) =103a(26) =173a(27) =83a(28) =317a(29) =79

External references