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 A142792 #14 Sep 08 2022 08:45:37
%S A142792 31,151,211,271,331,571,631,691,751,811,991,1051,1171,1231,1291,1471,
%T A142792 1531,1831,1951,2011,2131,2251,2311,2371,2551,2671,2731,2791,2851,
%U A142792 2971,3271,3331,3391,3511,3571,3631,3691,3931,4051,4111,4231,4591,4651,4831,4951
%N A142792 Primes congruent to 31 mod 60.
%H A142792 Vincenzo Librandi, <a href="/A142792/b142792.txt">Table of n, a(n) for n = 1..1000</a>
%F A142792 a(n) ~ 16n log n. - _Charles R Greathouse IV_, Jul 03 2016
%t A142792 Select[Prime[Range[1000]],Mod[#,60]==31&] (* _Harvey P. Dale_, Mar 14 2011 *)
%t A142792 Select[Prime[Range[800]], MemberQ[{31}, Mod[#, 60]] &] (* _Vincenzo Librandi_, Sep 04 2012 *)
%t A142792 Select[Range[31,5000,60],PrimeQ] (* Faster because it tests fewer numbers than the programs above *) (* _Harvey P. Dale_, Nov 13 2013 *)
%o A142792 (Magma) [p: p in PrimesUpTo(6000) | p mod 60 eq 31 ]; // _Vincenzo Librandi_, Sep 04 2012
%o A142792 (PARI) is(n)=isprime(n) && n%60==31 \\ _Charles R Greathouse IV_, Jul 03 2016
%Y A142792 Cf. A000040.
%K A142792 nonn,easy
%O A142792 1,1
%A A142792 _N. J. A. Sloane_, Jul 11 2008