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 A212492 #28 Mar 15 2024 02:25:24 %S A212492 7,19,31,61,97,127,139,181,229,271,337,409,421,607,631,811,1009,1021, %T A212492 1039,1051,1279,1291,1471,1597,1609,1657,1777,1861,1867,1987,2017, %U A212492 2131,2371,2539,2647,2677,2719,2791,3109,3319,3361,3457,3517,3529,3547,3571,3907 %N A212492 Prime p such that p, p+10, p+12 are all primes. %C A212492 All terms are congruent to 1 (mod 6). - _Zak Seidov_, Oct 28 2021 %H A212492 Salvatore Di Guida, <a href="/A212492/b212492.txt">Table of n, a(n) for n = 1..85</a> %t A212492 Select[Range[5000], PrimeQ[#] && PrimeQ[#+10] && PrimeQ[#+12] &] (* _T. D. Noe_, May 18 2012 *) %o A212492 (Python) %o A212492 from sympy import isprime, primerange %o A212492 def ok(p): return isprime(p+10) and isprime(p+12) %o A212492 print(list(filter(ok, primerange(1, 3910)))) # _Michael S. Branicky_, Oct 28 2021 %K A212492 nonn %O A212492 1,1 %A A212492 _Salvatore Di Guida_, May 18 2012