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 A049437 #28 Sep 08 2022 08:44:58 %S A049437 3,29,59,71,149,269,431,569,599,1031,1061,1229,1289,1319,1451,1619, %T A049437 2129,2339,2381,2549,2711,2789,3299,3539,4019,4049,4091,4649,4721, %U A049437 5099,5441,5519,5639,5741,5849,6269,6359,6569,6701,6959,7211 %N A049437 Primes p such that p+2 and p+8 are also primes but p+6 is not. %C A049437 p+4 is not prime here except for p=3. %H A049437 Iain Fox, <a href="/A049437/b049437.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from R. J. Mathar) %e A049437 p=29 is the smallest prime so that p, p+2 and p+8 are consecutive primes. %p A049437 select(p -> isprime(p) and isprime(p+2) and isprime(p+8) and not isprime(p+6), [3, seq(i,i=5..10000, 6)]); # _Robert Israel_, Nov 20 2017 %t A049437 {3}~Join~Select[Partition[Prime@ Range[10^3], 3, 1], Differences@ # == {2, 6} &][[All, 1]] (* _Michael De Vlieger_, Nov 20 2017 *) %o A049437 (Magma) [p: p in PrimesUpTo(8000)| IsPrime(p+2) and IsPrime(p+8) and not IsPrime(p+6) ] // _Vincenzo Librandi_, Jan 28 2011 %o A049437 (PARI) lista(nn) = forprime(p=3, nn, if(isprime(p+2) && isprime(p+8) && !isprime(p+6), print1(p, ", "))) \\ _Iain Fox_, Nov 20 2017 %Y A049437 Cf. A007530, A023202, A031926, A046134, A046138, A049436, A049438, A046138. %Y A049437 Subsequence of A001359. - _R. J. Mathar_, Feb 10 2013 %K A049437 nonn %O A049437 1,1 %A A049437 _Labos Elemer_