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 A191089 #9 May 13 2013 01:49:36
%S A191089 3,5,43,43,67,67,163,163,163,163,163,163,74093,170957,360293,679733,
%T A191089 2004917,2004917,51599563,51599563,96295483,96295483,146161723,
%U A191089 1408126003,1728061733,1728061733,1728061733,1728061733,1728061733,1728061733
%N A191089 Least prime p such that the first n primes are not squares mod p.
%C A191089 That is, the first n primes are quadratic non-residues mod p. A less restrictive form of A001992. Sequence A191088 is similar, but allows p to be composite. See A147972 for the square version.
%t A191089 Table[p = 2; While[Length[Select[Prime[Range[n]], JacobiSymbol[#, p] == -1 &]] < n, p = NextPrime[p]]; p, {n, 15}]
%o A191089 (PARI) q=2;forprime(k=3,1e9,forprime(p=2,q,if(kronecker(p,k)>=0,next(2)));print1(k", ");q=nextprime(q+1);k--) \\ _Charles R Greathouse IV_, Oct 10 2011
%Y A191089 Cf. A001992, A147972, A191088.
%K A191089 nonn
%O A191089 1,1
%A A191089 _T. D. Noe_, May 25 2011
%E A191089 a(16)-a(30) from _Charles R Greathouse IV_, Oct 10 2011