|
Search: id:A079305
|
|
|
| A079305 |
|
First near twin primes of order 6n: smallest p such that p, p+2, p+6n, and p+6n+2 are primes. |
|
+0
1
|
|
| 5, 5, 11, 5, 11, 5, 17, 11, 5, 11, 5, 29, 29, 17, 11, 5, 5, 29, 197, 17, 11, 5, 11, 5, 29, 41, 17, 11, 5, 11, 5, 5, 29, 107, 17, 11, 5, 11, 5, 29, 101, 17, 11, 5, 11, 5, 29, 59, 17, 11, 5, 107, 29, 107, 17, 11, 5, 71, 107, 59, 461, 59, 41, 137, 29, 431, 17, 11, 5, 11, 5, 29, 179
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
MATHEMATICA
|
a[n_] := For[p=5, True, p+=6, If[PrimeQ[p]&&PrimeQ[p+2]&&PrimeQ[p+6n]&&PrimeQ[p+6n+2], Return[p]]]
|
|
PROGRAM
|
(PARI) neartp(n) = { forstep(d=6, n, 6, forprime(x=3, n, if(isprime(x+2) & isprime(x+d) & isprime(x+d+2), print1(x", "); break ) ) ) }
|
|
CROSSREFS
|
Sequence in context: A082450 A087705 A087033 this_sequence A130889 A058610 A101203
Adjacent sequences: A079302 A079303 A079304 this_sequence A079306 A079307 A079308
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Feb 09 2003
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Feb 11 2003
|
|
|
Search completed in 0.002 seconds
|
