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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #22 May 25 2024 13:58:39
%S 294793,2586943,5360623,6351613,7965743,11141083,11378453,13458923,
%T 14884823,15585523,18691633,25387763,29964293,30766283,32388253,
%U 38647723,40653433,48716873,48786593,52628473,54270533,55507853,56575633,59103403
%N Primes that remain prime through 5 iterations of function f(x) = 8x + 9.
%C Primes p such that 8*p+9, 64*p+81, 512*p+657, 4096*p+5265 and 32768*p+42129 are also primes. - _Vincenzo Librandi_, Aug 05 2010
%H John Cerkan, <a href="/A023351/b023351.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) == 23 (mod 70). - _John Cerkan_, Nov 13 2016
%t prp5Q[n_]:=AllTrue[Rest[NestList[8#+9&,n,5]],PrimeQ]; Select[Prime[Range[3513000]],prp5Q] (* _Harvey P. Dale_, May 25 2024 *)
%t prp5Q2[n_] := AllTrue[NestList[8 # + 9 &, n, 5], PrimeQ]; Select[Range[23, 59120000, 70], prp5Q2] (* Faster than the first Mathematica program above. *) (* _Harvey P. Dale_, May 25 2024 *)
%o (Magma) [n: n in [1..19000000] | IsPrime(n) and IsPrime(8*n+9) and IsPrime(64*n+81) and IsPrime(512*n+657) and IsPrime(4096*n+5265) and IsPrime(32768*n+42129)] // _Vincenzo Librandi_, Aug 05 2010
%Y Subsequence of A023232, A023264, A023295, A023323, and of A153762.
%K nonn
%O 1,1
%A _David W. Wilson_