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 A229947 #25 Sep 08 2022 08:46:06
%S A229947 11,13,17,19,29,31,41,43,47,59,61,71,73,79,89,101,103,107,109,131,137,
%T A229947 139,149,151,163,167,179,181,191,193,197,199,211,223,227,229,239,241,
%U A229947 251,257,269,271,281,283,311,313,317,331,347,349,359,373,379,389
%N A229947 Primes congruent to {1, 11, 13, 17, 19, 29} mod 30.
%C A229947 For twin primes congruent to {1, 11, 13, 17, 19, 29} mod 30 see A132247.
%C A229947 Complement of A132237, primes congruent to 7 or 23 (mod 30), in the set of primes > 5. - _M. F. Hasler_, Nov 02 2013
%H A229947 Omar E. Pol, <a href="http://www.polprimos.com/imagenes/cribade30columnas.jpg">Prime numbers in a sieve with 30 columns</a>
%F A229947 a(n) ~ 4/3 n log n. - _Charles R Greathouse IV_, Mar 08 2015
%t A229947 Select[Flatten[Table[30n + {1, 11, 13, 17, 19, 29}, {n, 0, 11}]], PrimeQ] (* _Alonso del Arte_, Nov 01 2013 *)
%t A229947 Select[Prime@Range[100], MemberQ[{1, 11, 13, 17, 19, 29}, Mod[#, 30]] &] (* _Vincenzo Librandi_, Apr 05 2015 *)
%o A229947 (PARI) is(n)=isprime(n) && setsearch([1,11,13,17,19,29], n%30) \\ _Charles R Greathouse IV_, Mar 08 2015
%o A229947 (Magma) [p: p in PrimesUpTo(500) | p mod 30 in {1,11,13,17, 19,29} ]; // _Vincenzo Librandi_, Apr 05 2015
%Y A229947 Cf. A000040, A001097, A039949, A132230, A132232-A132234, A132236, A132238-A132259, A230462.
%K A229947 nonn,easy
%O A229947 1,1
%A A229947 _Omar E. Pol_, Oct 27 2013