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

%I #8 Feb 27 2016 09:55:39

%S 2,31,283,2357,1069,8017,16703,7963,88177,39461,129127,101221,452873,

%T 153763,525043,473027,283303,1714963,949307,736279,1232089,7865171,

%U 1138273,20167369,14402813,12501067,1098847,3240983

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

%H Zak Seidov, <a href="/A268879/b268879.txt">Table of n, a(n) for n = 1..50</a>

%F a(n) = prime(A268863(n)) = A000040(A268863(n)).

%e See A268863.

%Y Cf. A000040, A268863.

%K nonn

%O 1,1

%A _Zak Seidov_, Feb 15 2016