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.

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

This page as a plain text file.
%I A023337 #23 Sep 08 2022 08:44:47
%S A023337 3181,61981,134291,342821,459091,882451,984931,1016011,1028471,
%T A023337 1181701,1391561,1897801,2009311,2272301,2476421,2769791,3048041,
%U A023337 3085421,3128821,3207221,3545111,4092931,4690591,5015321,5863651,6027941,6361351,6796541
%N A023337 Primes that remain prime through 5 iterations of function f(x) = 3x + 8.
%C A023337 Primes p such that 3*p+8, 9*p+32, 27*p+104, 81*p+320, and 243*p+968 are also primes. - _Vincenzo Librandi_, Aug 05 2010
%H A023337 John Cerkan, <a href="/A023337/b023337.txt">Table of n, a(n) for n = 1..10000</a>
%F A023337 a(n) == 31 (mod 70). - _John Cerkan_, Oct 11 2016
%t A023337 Select[Prime[Range[500000]],And@@PrimeQ[Rest[NestList[3#+8&,#,5]]]&] (* _Harvey P. Dale_, Apr 07 2014 *)
%o A023337 (Magma) [n: n in [1..25000000] | IsPrime(n) and IsPrime(3*n+8) and IsPrime(9*n+32) and IsPrime(27*n+104) and IsPrime(81*n+320) and IsPrime(243*n+968)] // _Vincenzo Librandi_, Aug 05 2010
%o A023337 (PARI) is(n)=isprime(n) && isprime(3*n+8) && isprime(9*n+32) && isprime(27*n+104) && isprime(81*n+320) && isprime(243*n+968) \\ _Charles R Greathouse IV_, Oct 11 2016
%Y A023337 Subsequence of A023210, A023248, A023279, and A023309.
%K A023337 nonn
%O A023337 1,1
%A A023337 _David W. Wilson_