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

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023319 Primes that remain prime through 4 iterations of function f(x) = 8x + 1. 2

%I

%S 2207,126107,230567,366347,590207,788027,831167,919067,985937,1111427,

%T 1154567,1170857,1367507,1463597,1624757,1934417,2034797,2468027,

%U 2502767,2545307,3019787,3287027,3385817,3675197,3692207,4087757,4565927,4600577

%N Primes that remain prime through 4 iterations of function f(x) = 8x + 1.

%C Primes p such that 8*p+1, 64*p+9, 512*p+73 and 4096*p+585 are also primes. - _Vincenzo Librandi_, Aug 04 2010

%H Harvey P. Dale, <a href="/A023319/b023319.txt">Table of n, a(n) for n = 1..1000</a>

%t rp4Q[n_]:=AllTrue[Rest[NestList[8#+1&,n,4]],PrimeQ]; Select[Prime[ Range[ 325000]],rp4Q] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Dec 23 2014 *)

%o (Magma) [n: n in [1..5000000] | IsPrime(n) and IsPrime(8*n+1) and IsPrime(64*n+9) and IsPrime(512*n+73) and IsPrime(4096*n+585)] // _Vincenzo Librandi_, Aug 04 2010

%K nonn

%O 1,1

%A _David W. Wilson_

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.

Last modified December 3 09:03 EST 2022. Contains 358515 sequences. (Running on oeis4.)