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.

A023310 Primes that remain prime through 4 iterations of function f(x) = 3x + 10.

This page as a plain text file.
%I A023310 #21 Sep 08 2022 08:44:47
%S A023310 3,199,233,709,1361,1367,2137,2879,5519,5987,7283,9719,11699,14983,
%T A023310 16417,17881,20939,24481,30467,31663,31741,35107,35863,46811,47869,
%U A023310 49261,58207,60497,63317,64781,68777,73453,74021,79901,85487,85571,94327,94999
%N A023310 Primes that remain prime through 4 iterations of function f(x) = 3x + 10.
%C A023310 Primes p such that 3*p+10, 9*p+40, 27*p+130 and 81*p+400 are also primes. - _Vincenzo Librandi_, Aug 04 2010
%H A023310 John Cerkan, <a href="/A023310/b023310.txt">Table of n, a(n) for n = 1..10000</a>
%F A023310 a(n) == 3 or 9 (mod 14). - _John Cerkan_, Oct 04 2016
%t A023310 Select[Range[10^5], Times @@ Boole@ PrimeQ@ NestList[3 # + 10 &, #, 4] > 0 &] (* _Michael De Vlieger_, Oct 04 2016 *)
%o A023310 (Magma) [n: n in [1..1000000] | IsPrime(n) and IsPrime(3*n+10) and IsPrime(9*n+40) and IsPrime(27*n+130) and IsPrime(81*n+400)] // _Vincenzo Librandi_, Aug 04 2010
%o A023310 (PARI) is(n)=isprime(n) && isprime(3*n+10) && isprime(9*n+40) && isprime(27*n+130) && isprime(81*n+400) \\ _Charles R Greathouse IV_, Oct 04 2016
%Y A023310 Subsequence of A023211, A023249, and A023280.
%K A023310 nonn
%O A023310 1,1
%A A023310 _David W. Wilson_