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 A003626 M4769 #26 May 22 2022 09:43:23
%S A003626 11,13,17,19,31,37,53,59,71,73,79,97,113,131,137,139,151,157,173,179,
%T A003626 191,193,197,199,211,233,239,251,257,271,277,293,311,313,317,331,337,
%U A003626 353,359,373,379,397,419,431,433,439,457,479,491,499,557,571,577,593,599
%N A003626 Inert rational primes in Q(sqrt(-5)).
%C A003626 Primes congruent to 11, 13, 17, 19 (mod 20). - _Michael Somos_, Aug 14 2012
%C A003626 Legendre symbol (-5, a(n)) = -1. For prime 5 this symbol is set to 0, and for other odd primes (-5, prime) = +1, given in A139513. - _Wolfdieter Lang_, Mar 05 2021
%D A003626 H. Hasse, Number Theory, Springer-Verlag, NY, 1980, p. 498.
%D A003626 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A003626 Vincenzo Librandi, <a href="/A003626/b003626.txt">Table of n, a(n) for n = 1..5000</a>
%H A003626 R. G. Wilson, V, <a href="/A007376/a007376.pdf">Letter to N. J. A. Sloane, Oct. 1993</a>
%H A003626 <a href="https://oeis.org/index/Pri#primes_decomp_of">Index to sequences related to decomposition of primes in quadratic fields</a>
%t A003626 Select[Prime[Range[1000]],MemberQ[{11,13,17,19},Mod[#,20]]&] (* _Vincenzo Librandi_, Aug 20 2012 *)
%o A003626 (PARI) {a(n) = local( cnt, m ); if( n<1, return( 0 )); while( cnt < n, if( isprime( m++) && kronecker( -20, m )==-1, cnt++ )); m} /* _Michael Somos_, Aug 14 2012 */
%Y A003626 Cf. A139513.
%K A003626 nonn,nice
%O A003626 1,1
%A A003626 _N. J. A. Sloane_, _Mira Bernstein_