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 A222756 #7 Mar 06 2013 22:14:21
%S A222756 5,13,11,59,421,131,1811,2939,13381,12011,66491,148139,275651,644869,
%T A222756 2269739,3462229,6810301,16145221,120078131
%N A222756 Smallest prime p > prime(n+2) such that the first n odd primes 3, 5, 7, 11, ..., prime(n+1) are quadratic residues mod p, and prime(n+2) is a quadratic non-residue mod p.
%C A222756 Same as smallest prime p such that the Legendre symbol (q|p) = 1 for the first n odd primes q = prime(k+1), k = 1, 2, ..., n, and (q|p) = -1 for q = prime(n+2).
%t A222756 f[n_] := Block[{k = 2}, While[JacobiSymbol[Prime[k], n] == 1, k++]; Prime[k]]; nn = 15; t = Table[0, {nn}]; t[[1]] = 1; n = 2; While[Min[t] == 0, n++; p = Prime[n]; a = f[p]; ppa = PrimePi[a]; If[ppa <= nn && t[[ppa]] == 0, t[[ppa]] = p]]; Rest[t]
%Y A222756 Cf. A096636 (p and q switched).
%K A222756 nonn
%O A222756 0,1
%A A222756 _T. D. Noe_, Mar 06 2013
%E A222756 Simpler definition from _Jonathan Sondow_, Mar 06 2013