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 A039949 #46 Sep 08 2022 08:44:53
%S A039949 17,47,107,137,167,197,227,257,317,347,467,557,587,617,647,677,797,
%T A039949 827,857,887,947,977,1097,1187,1217,1277,1307,1367,1427,1487,1607,
%U A039949 1637,1667,1697,1787,1847,1877,1907,1997,2027,2087,2207,2237,2267,2297,2357,2417
%N A039949 Primes of the form 30n - 13.
%C A039949 This linear form produces the most primes for n between 1 and 1000 (411/1000).
%C A039949 Primes congruent to 17 (mod 30). - _Omar E. Pol_, Aug 15 2007
%C A039949 Primes ending in 7 with (SOD-1)/3 non-integer where SOD is sum of digits. - _Ki Punches_
%C A039949 Or primes p such that (p mod 3) = (p mod 5) and (p mod 2) <> (p mod 3), (p > 2). - _Mikk Heidemaa_, Jan 19 2016
%D A039949 C. Clawson, Mathematical Mysteries, Plenum Press, 1996, p. 173
%H A039949 Vincenzo Librandi, <a href="/A039949/b039949.txt">Table of n, a(n) for n = 1..1000</a>
%F A039949 a(n) = A158648(n)*30 + 17. - _Ray Chandler_, Apr 07 2009
%F A039949 Intersection of A030432 and A007528. - _Ray Chandler_, Apr 07 2009
%F A039949 a(n) = A141860(n+1). - _Zak Seidov_, Apr 15 2015
%t A039949 Select[Prime[Range[1000]],MemberQ[{17},Mod[#,30]]&] (* _Vincenzo Librandi_, Aug 04 2012 *)
%t A039949 Select[Range[17,3000,30],PrimeQ] (* _Zak Seidov_, Apr 15 2015 *)
%o A039949 (Magma) [p: p in PrimesUpTo(3000) | p mod 30 in [17]]; // _Vincenzo Librandi_, Aug 04 2012
%o A039949 (PARI) select(n->n%30==17, primes(500)) \\ _Charles R Greathouse IV_, Apr 28 2015
%Y A039949 Cf. A132230-A132236, A141860.
%K A039949 nonn,easy
%O A039949 1,1
%A A039949 _Felice Russo_
%E A039949 Extended by _Ray Chandler_, Apr 07 2009