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 A132237 #14 Sep 08 2022 08:45:31
%S A132237 7,23,37,53,67,83,97,113,127,157,173,233,263,277,293,307,337,353,367,
%T A132237 383,397,443,457,487,503,547,563,577,593,607,653,683,727,743,757,773,
%U A132237 787,863,877,907,937,953,967,983,997,1013,1087,1103
%N A132237 Primes congruent to {7, 23} mod 30.
%C A132237 Up to 4913, there are more primes of this form than composites. See also A132231 and A227869 (congruent to 7 only). - _M. F. Hasler_, Nov 02 2013
%H A132237 Vincenzo Librandi, <a href="/A132237/b132237.txt">Table of n, a(n) for n = 1..1000</a>
%H A132237 C. K. Caldwell, <a href="http://primes.utm.edu">The Prime Pages</a>.
%H A132237 Omar E. Pol, <a href="http://www.polprimos.com">Determinacion geometrica de los numeros primos y perfectos</a>.
%t A132237 Select[Prime[Range[1000]],MemberQ[{7,23},Mod[#,30]]&] (* _Vincenzo Librandi_, Aug 14 2012 *)
%o A132237 (Magma) [ p: p in PrimesUpTo(1300) | p mod 30 in [7, 23] ]; // _Vincenzo Librandi_, Aug 14 2012
%o A132237 (PARI) is_A132237(n)=setsearch([7,23],n%30)&&isprime(n) \\ - _M. F. Hasler_, Nov 02 2013
%Y A132237 Cf. A000040, A007510, A039949, A068229, A129807.
%K A132237 easy,nonn
%O A132237 1,1
%A A132237 _Omar E. Pol_, Aug 15 2007