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 A003632 M3806 #17 Dec 31 2017 16:40:25
%S A003632 5,11,13,17,23,41,43,61,67,71,73,79,89,97,101,107,127,151,157,163,173,
%T A003632 179,181,191,211,229,239,241,257,263,269,293,313,331,347,349,353,359,
%U A003632 379,397,409,431,433,443,461,463,487,491,499,509,521,547,571,577,593,599
%N A003632 Inert rational primes in Q(sqrt 7), or, 7 is not a square mod p.
%C A003632 Primes congruent to 5, 11, 13, 15, 17, 23 (modulo 28). - _Michael Somos_, Aug 14 2012
%D A003632 H. Hasse, Number Theory, Springer-Verlag, NY, 1980, p. 498.
%D A003632 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A003632 Vincenzo Librandi, <a href="/A003632/b003632.txt">Table of n, a(n) for n = 1..5000</a>
%H A003632 <a href="https://oeis.org/wiki/Index_to_OEIS:_Section_Pri#primes_decomp_of">Index to sequences related to decomposition of primes in quadratic fields</a>
%t A003632 Select[Prime[Range[1000]],MemberQ[{5,11,13,15,17,23},Mod[#,28]]&] (* _Vincenzo Librandi_, Aug 20 2012 *)
%o A003632 (PARI) {a(n) = local( cnt, m ); if( n<1, return( 0 )); while( cnt < n, if( isprime( m++) && kronecker( 7, m )== -1, cnt++ )); m} /* _Michael Somos_, Aug 14 2012 */
%K A003632 nonn
%O A003632 1,1
%A A003632 _N. J. A. Sloane_, _Mira Bernstein_