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 A140560 #29 Sep 08 2022 08:45:34 %S A140560 2,3,5,19,47,61,89,103,113,131,139,157,173,179,191,223,229,257,269, %T A140560 271,293,311,313,331,347,373,383,397,421,439,443,463,467,487,499,503, %U A140560 509,521,523,593,599,607,619,641,659,673,677,683,691,701,719,733,751,761 %N A140560 Primes p such that p + 30 is not a prime. %H A140560 Daniel Starodubtsev, <a href="/A140560/b140560.txt">Table of n, a(n) for n = 1..10000</a> %p A140560 A140560:=n->`if`(isprime(n) and not isprime(n+30), n, NULL): seq(A140560(n), n=1..2*10^3); # _Wesley Ivan Hurt_, Apr 14 2017 %t A140560 Select[Prime[Range[200]],!PrimeQ[#+30]&] (* _Harvey P. Dale_, Oct 21 2013 *) %o A140560 (Magma)[p: p in PrimesUpTo(1000)|not IsPrime(p+30)] // _Vincenzo Librandi_, Dec 18 2010 %o A140560 (PARI) isok(n) = isprime(n) && !isprime(n+30); \\ _Michel Marcus_, Apr 14 2017 %o A140560 (Python) %o A140560 from sympy import isprime, primerange %o A140560 print([p for p in primerange(1, 1001) if not isprime(p + 30)]) # _Indranil Ghosh_, Apr 14 2017 %Y A140560 Cf. A049481. %K A140560 nonn %O A140560 1,1 %A A140560 _Juri-Stepan Gerasimov_, Jul 03 2008 %E A140560 Corrected (3, 5 inserted) by _R. J. Mathar_, Apr 25 2010