login
Primes p such that gcd(p(n)-1, p(n+1)-1) != gcd(p(n)+1, p(n+1)+1).
2

%I #5 Aug 02 2019 21:55:17

%S 7,13,19,23,31,37,43,47,53,61,67,73,79,83,89,97,103,109,113,127,131,

%T 139,151,157,163,167,173,181,193,199,211,223,229,233,241,251,257,263,

%U 271,277,293,307,313,331,349,353,359,367,373,379,383,389,397,401,409,421

%N Primes p such that gcd(p(n)-1, p(n+1)-1) != gcd(p(n)+1, p(n+1)+1).

%t lst={};Do[p0=Prime[n];p1=Prime[n+1];If[GCD[p0-1,p1-1]!=GCD[p0+1,p1+1],AppendTo[lst,p0]],{n,6!}];lst

%Y Cf. A063091

%K nonn

%O 1,1

%A _Vladimir Joseph Stephan Orlovsky_, Apr 11 2010