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.
%I A164568 #12 Dec 23 2023 13:48:43 %S A164568 3,7,11,13,29,41,53,59,67,97,109,179,223,239,263,353,389,409,461,463, %T A164568 557,601,613,631,673,757,773,839,857,937,967,977,1019,1163,1277,1301, %U A164568 1327,1471,1627,1753,1789,1877,1879,2027,2087,2237,2251,2269,2311,2351 %N A164568 Primes p such that 9*p-10 and 9*p+10 are prime numbers. %H A164568 Robert Israel, <a href="/A164568/b164568.txt">Table of n, a(n) for n = 1..10000</a> %e A164568 9*3-10=17, 9*3+10=37, ... %p A164568 filter:= n -> isprime(n) and isprime(9*n-10) and isprime(9*n+10): %p A164568 select(filter, [seq(i,i=3..1000,2)]); # _Robert Israel_, Jun 29 2016 %t A164568 lst={};Do[p=Prime[n];If[PrimeQ[9*p-10]&&PrimeQ[9*p+10],AppendTo[lst,p]],{n,2*6!}];lst %t A164568 Select[Prime[Range[400]], PrimeQ[9 # - 10] && PrimeQ[9 # + 10] &] (* _Vincenzo Librandi_, Jun 30 2016 *) %t A164568 Select[Prime[Range[400]],AllTrue[9#+{10,-10},PrimeQ]&] (* _Harvey P. Dale_, Dec 23 2023 *) %o A164568 (PARI) forprime(p=3,1e4,if(isprime(9*p-10)&&isprime(9*p+10),print1(p","))) %o A164568 (Magma) [p: p in PrimesUpTo(2500) |IsPrime(9*p-10) and IsPrime(9*p+10)]; // _Vincenzo Librandi_, Jun 30 2016 %Y A164568 Cf. A106015, A124098, A125272, A127430, A153768, A164566, A164567 %K A164568 nonn %O A164568 1,1 %A A164568 _Vladimir Joseph Stephan Orlovsky_, Aug 16 2009 %E A164568 Edited by _Charles R Greathouse IV_, Nov 02 2009