The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A121764 Single (or isolated or non-twin) primes of form 6n + 1. 3
37, 67, 79, 97, 127, 157, 163, 211, 223, 277, 307, 331, 337, 367, 373, 379, 397, 409, 439, 457, 487, 499, 541, 547, 577, 607, 613, 631, 673, 691, 709, 727, 733, 739, 751, 757, 769, 787, 853, 877, 907, 919, 937, 967, 991, 997, 1009, 1039, 1069, 1087, 1117 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
For the first 30000 terms a(n) > A121762(n), see plot A121764(n) - A121762(n). But is it so for all n? - Zak Seidov, Apr 25 2015
Subsequence of A002476. - Michel Marcus, Apr 26 2015
LINKS
MATHEMATICA
Select[Table[6n + 1, {n, 200}], PrimeQ[#] && !PrimeQ[#-2] &] (* Ray Chandler, Aug 22 2006 *)
Select[Prime[Range[200]], Mod[#, 6]==1&&NoneTrue[#+{2, -2}, PrimeQ]&] (* Harvey P. Dale, Jul 16 2021 *)
PROG
(PARI) {is(n)=n%6==1 && isprime(n) && !isprime(n-2)}; \\ G. C. Greubel, Feb 26 2019
(Magma) [n: n in [1..1150] | (n mod 6 eq 1) and not IsPrime(n-2) and IsPrime(n)]; // G. C. Greubel, Feb 26 2019
(Sage) [n for n in (1..1150) if mod(n, 6)==1 and not is_prime(n-2) and is_prime(n)] # G. C. Greubel, Feb 26 2019
CROSSREFS
Sequence in context: A117475 A145486 A319673 * A131499 A217659 A054805
KEYWORD
nonn
AUTHOR
Lekraj Beedassy, Aug 20 2006
EXTENSIONS
Extended by Ray Chandler, Aug 22 2006
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 13 00:07 EDT 2024. Contains 372497 sequences. (Running on oeis4.)