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!)
A176180 Primes p such that gcd(p(n)-1, p(n+1)-1) != gcd(p(n)+1, p(n+1)+1). 2
7, 13, 19, 23, 31, 37, 43, 47, 53, 61, 67, 73, 79, 83, 89, 97, 103, 109, 113, 127, 131, 139, 151, 157, 163, 167, 173, 181, 193, 199, 211, 223, 229, 233, 241, 251, 257, 263, 271, 277, 293, 307, 313, 331, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 421 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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, 6!}]; lst
CROSSREFS
Sequence in context: A033561 A227030 A049591 * A209623 A058620 A038910
KEYWORD
nonn
AUTHOR
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 May 11 05:30 EDT 2024. Contains 372388 sequences. (Running on oeis4.)