cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A023319 #21 Sep 08 2022 08:44:47
%S A023319 2207,126107,230567,366347,590207,788027,831167,919067,985937,1111427,
%T A023319 1154567,1170857,1367507,1463597,1624757,1934417,2034797,2468027,
%U A023319 2502767,2545307,3019787,3287027,3385817,3675197,3692207,4087757,4565927,4600577
%N A023319 Primes that remain prime through 4 iterations of function f(x) = 8x + 1.
%C A023319 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 A023319 Harvey P. Dale, <a href="/A023319/b023319.txt">Table of n, a(n) for n = 1..1000</a>
%t A023319 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 A023319 (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 A023319 nonn
%O A023319 1,1
%A A023319 _David W. Wilson_