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.

A023292 Primes that remain prime through 3 iterations of function f(x) = 8x + 3.

This page as a plain text file.
%I A023292 #24 Aug 28 2024 14:45:48
%S A023292 31,191,821,3271,11171,13121,14591,21521,27751,30341,35951,37561,
%T A023292 39671,40231,43651,51061,51551,56671,68161,73681,84871,91541,92581,
%U A023292 102031,102871,102881,104971,117281,127781,128201,128551,128761,138511,148091
%N A023292 Primes that remain prime through 3 iterations of function f(x) = 8x + 3.
%C A023292 Primes p such that 8*p+3, 64*p+27 and 512*p+219 are also primes. - _Vincenzo Librandi_, Aug 04 2010
%H A023292 Harvey P. Dale, <a href="/A023292/b023292.txt">Table of n, a(n) for n = 1..1000</a>
%t A023292 Select[Prime[Range[14000]],AllTrue[Rest[NestList[8#+3&,#,3]],PrimeQ]&] (* The program uses the AllTrue function from Mathematica version 10 *) (* _Harvey P. Dale_, Oct 09 2015 *)
%o A023292 (Magma) [n: n in [1..450000] | IsPrime(n) and IsPrime(8*n+3) and IsPrime(64*n+27) and IsPrime(512*n+219)]; // _Vincenzo Librandi_, Aug 04 2010
%K A023292 nonn
%O A023292 1,1
%A A023292 _David W. Wilson_