a(n) is the least prime p=prime(m) such that gcd (prime(m) + 2, prime(m + 1) + 2) = 2*n - 1.

Terms

a(0) =2a(1) =31a(2) =283a(3) =2357a(4) =1069a(5) =8017a(6) =16703a(7) =7963a(8) =88177a(9) =39461a(10) =129127a(11) =101221a(12) =452873a(13) =153763a(14) =525043a(15) =473027a(16) =283303a(17) =1714963a(18) =949307a(19) =736279a(20) =1232089a(21) =7865171a(22) =1138273a(23) =20167369a(24) =14402813a(25) =12501067a(26) =1098847a(27) =3240983