|
| |
|
|
A007528
|
|
Primes of form 6n-1.
(Formerly M3809)
|
|
44
| |
|
|
5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, 107, 113, 131, 137, 149, 167, 173, 179, 191, 197, 227, 233, 239, 251, 257, 263, 269, 281, 293, 311, 317, 347, 353, 359, 383, 389, 401, 419, 431, 443, 449, 461, 467, 479, 491, 503, 509, 521, 557, 563, 569, 587
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| For values of n see A024898.
Contribution from Cino Hilliard (hillcino368(AT)hotmail.com), Nov 12 2008: (Start)
Also primes p such that p^q - 2 is not prime where q is an odd prime. These
numbers cannot be prime because the binomial p^q = (6n-1)^q expands to 6h-1
some h. Then p^q-2 = 6h-1-2 is divisible by 3 thus not prime. (End)
|
|
|
REFERENCES
| M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
|
|
|
FORMULA
| A003627 \ {2}. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 28 2008]
|
|
|
MATHEMATICA
| a={}; Do[x=6*n-1; If[PrimeQ[x], AppendTo[a, x]], {n, 10^2}]; a - Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 29 2008
Select[6Range[100]-1, PrimeQ] (* From Harvey P. Dale, Feb 14 2011 *)
|
|
|
PROG
| (PARI) forprime(p=2, 1e3, if(p%6==5, print1(p", "))) \\ Charles R Greathouse IV, Jul 15 2011
|
|
|
CROSSREFS
| Sequence in context: A016969 * A144918 A144920 A051615 A063909 A181575
Adjacent sequences: A007525 A007526 A007527 * A007529 A007530 A007531
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
