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 A141860 #24 Sep 08 2022 08:45:35
%S A141860 2,17,47,107,137,167,197,227,257,317,347,467,557,587,617,647,677,797,
%T A141860 827,857,887,947,977,1097,1187,1217,1277,1307,1367,1427,1487,1607,
%U A141860 1637,1667,1697,1787,1847,1877,1907,1997,2027,2087,2207,2237,2267,2297,2357,2417
%N A141860 Primes congruent to 2 mod 15.
%C A141860 2, and primes congruent to 17 mod 30. - _Robert Israel_, Jan 19 2016
%H A141860 Vincenzo Librandi, <a href="/A141860/b141860.txt">Table of n, a(n) for n = 1..1000</a>
%F A141860 {2} UNION A039949. - _R. J. Mathar_, Jul 20 2008
%p A141860 select(isprime, [2, seq(i,i=17..1000, 30)]); # _Robert Israel_, Jan 19 2016
%t A141860 Select[Prime[Range[400]],MemberQ[{2},Mod[#,15]]&] (* _Vincenzo Librandi_, Aug 15 2012 *)
%t A141860 Select[Range[2,2500,15],PrimeQ] (* _Harvey P. Dale_, Dec 08 2012 *)
%o A141860 (Magma) [ p: p in PrimesUpTo(5000) | p mod 15 eq 2 ]; // _Vincenzo Librandi_, Apr 19 2011
%o A141860 (PARI) lista(nn) = for(n=0, nn, if(ispseudoprime(p=15*n+2), print1(p, ", "))); \\ _Altug Alkan_, Jan 19 2016
%K A141860 nonn,easy
%O A141860 1,1
%A A141860 _N. J. A. Sloane_, Jul 11 2008