login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176181 Primes p(n) such that gcd(p(n)-1, p(n+1)-1) > gcd(p(n)+1, p(n+1)+1). 2
13, 31, 37, 61, 73, 89, 97, 109, 113, 151, 157, 181, 193, 199, 211, 229, 241, 271, 277, 313, 331, 349, 367, 373, 389, 397, 401, 421, 433, 449, 457, 523, 541, 571, 601, 607, 613, 619, 631, 661, 673, 691, 701, 727, 733, 751, 757, 761, 769, 811, 853, 877, 929 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Sequence does not contain any lesser of twin primes A001359. (Proof. If p(n+1) = p(n)+2, then gcd(p(n)-1, p(n+1)-1) = 2 = gcd(p(n)+1, p(n+1)+1), so p(n) is not a term.) - Jonathan Sondow, Feb 03 2012
LINKS
MATHEMATICA
lst={}; Do[p0=Prime[n]; p1=Prime[n+1]; If[GCD[p0-1, p1-1] > GCD[p0+1, p1+1], AppendTo[lst, p0]], {n, 200}]; lst
Transpose[Select[Partition[Prime[Range[200]], 2, 1], GCD@@(#-1)>GCD@@(#+1)&]] [[1]] (* Harvey P. Dale, Sep 30 2014 *)
CROSSREFS
Sequence in context: A103665 A040050 A040086 * A023274 A349636 A129864
KEYWORD
nonn
AUTHOR
EXTENSIONS
Definition clarified by Jonathan Sondow, Feb 03 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)