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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057328 First member of a prime 5-tuple in a 2p-1 progression. 14
1531, 6841, 15391, 16651, 33301, 44371, 57991, 66601, 83431, 105871, 145021, 150151, 165901, 199621, 209431, 212851, 231241, 242551, 291271, 319681, 331801, 346141, 377491, 381631, 385591, 445741, 451411, 478801, 481021, 506791, 507781 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Numbers n such that n remains prime through 4 iterations of function f(x) = 2x - 1.
LINKS
EXAMPLE
Quintuplets are (1531, 3061, 6121, 12241, 24481), (6841, 13681, 27361, 54721, 109441), ...
MATHEMATICA
pQ[n_] := And @@ PrimeQ[NestList[2 # - 1 &, n, 4]]; t = {}; Do[p = Prime[n]; If[pQ[p], AppendTo[t, p]], {n, 42500}]; t (* Jayanta Basu, Jun 17 2013 *)
Select[Prime[Range[50000]], AllTrue[Rest[NestList[2#-1&, #, 4]], PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Mar 30 2019 *)
PROG
(Magma) [ p: p in PrimesUpTo(6*10^5) | forall{q: k in [1..4] | IsPrime(q) where q is 2^k*(p-1)+1} ]; // Bruno Berselli, Nov 23 2011
CROSSREFS
Sequence in context: A122707 A347200 A057327 * A110022 A339075 A355963
KEYWORD
nonn
AUTHOR
Patrick De Geest, Aug 15 2000
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 December 2 19:40 EST 2023. Contains 367526 sequences. (Running on oeis4.)