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 A132232 #24 Feb 16 2024 10:21:24
%S A132232 11,41,71,101,131,191,251,281,311,401,431,461,491,521,641,701,761,821,
%T A132232 881,911,941,971,1031,1061,1091,1151,1181,1301,1361,1451,1481,1511,
%U A132232 1571,1601,1721,1811,1871,1901,1931,2081,2111,2141,2351,2381,2411,2441,2531
%N A132232 Primes congruent to 11 (mod 30).
%H A132232 Vincenzo Librandi, <a href="/A132232/b132232.txt">Table of n, a(n) for n = 1..1000</a>
%H A132232 C. K. Caldwell, <a href="http://primes.utm.edu">The Prime Pages</a>.
%H A132232 Omar E. Pol, <a href="http://www.polprimos.com">Determinacion geometrica de los numeros primos y perfectos</a>.
%F A132232 From _Ray Chandler_, Apr 07 2009: (Start)
%F A132232 a(n) = A158614(n)*30 + 11.
%F A132232 Intersection of A030430 and A007528. (End)
%t A132232 Select[Prime[Range[1000]],MemberQ[{11},Mod[#,30]]&] (* _Vincenzo Librandi_, Aug 14 2012 *)
%t A132232 Select[Range[11,2600,30],PrimeQ] (* _Harvey P. Dale_, Mar 07 2020 *)
%o A132232 (Magma) [p: p in PrimesUpTo(3000) | p mod 30 eq 11 ]; // _Vincenzo Librandi_, Aug 14 2012
%o A132232 (PARI) is(n)=isprime(n) && n%30==11 \\ _Charles R Greathouse IV_, Jul 01 2016
%Y A132232 Cf. A000040, A068231, A039949.
%Y A132232 Cf. A132230, A132231, A132233, A132234, A132235, A132236.
%K A132232 nonn,easy
%O A132232 1,1
%A A132232 _Omar E. Pol_, Aug 15 2007
%E A132232 Extended by _Ray Chandler_, Apr 07 2009