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 A096637 #10 Mar 07 2013 17:11:59
%S A096637 17,73,241,1009,2689,8089,33049,53881,87481,483289,515761,1083289,
%T A096637 7921489,3818929,9257329,22000801,68204761,48473881,175244281,
%U A096637 1149374521,427733329,898716289
%N A096637 Smallest prime p == 1 mod 8 (A007519) and p > prime(n+2) such that p is a quadratic residue mod the first n odd primes 3, 5, 7, 11, ..., prime(n+1), and p is a quadratic non-residue mod prime(n+2).
%C A096637 Same as smallest prime p == 1 mod 8 with the property that the Legendre symbol (p|q) = 1 for the first n odd primes q = prime(k+1), k = 1, 2, ..., n, and (p|q) = -1 for q = prime(n+2).
%t A096637 f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; t = Table[0, {50}]; Do[p = Prime[n]; If[Mod[p, 8] == 1, a = f[p]; If[ t[[ PrimePi[a]]] == 0, t[[ PrimePi[a]]] = p; Print[ PrimePi[a], " = ", p]]], {n, 10^9}]; t
%Y A096637 Cf. A094928, A002224, A096636.
%K A096637 nonn
%O A096637 0,1
%A A096637 _Robert G. Wilson v_, Jun 24 2004
%E A096637 Better name from _Jonathan Sondow_, Mar 07 2013