Smallest prime p=prime(k) such that there exist numbers i and j with prime(k-1) < i < p < j < prime(k+1) and gcd(i,j)=n.

A117392

Smallest prime p=prime(k) such that there exist numbers i and j with prime(k-1) < i < p < j < prime(k+1) and gcd(i,j)=n.

Terms

    a(0) =7a(1) =11a(2) =47a(3) =29a(4) =23a(5) =37a(6) =157a(7) =97a(8) =199a(9) =89a(10) =127a(11) =113a(12) =317a(13) =331a(14) =839a(15) =479a(16) =293a(17) =211a(18) =541a(19) =1399a(20) =1973a(21) =1637a(22) =1129a(23) =3229a(24) =2971a(25) =3433a(26) =7253a(27) =6397a(28) =2179a(29) =3989

External references