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 A096633 #3 Mar 30 2012 17:31:04
%S A096633 3,3,7,5,3,5,3,3,3,7,5,3,11,3,3,5,5,13,3,13,3,3,3,3,13,5,5,3,11,3,7,5,
%T A096633 3,3,7,11,5,7,3,7,5,5,3,3,3,11,3,5,3,19,3,3,3,7,3,3,3,7,5,3,3,7,3,11,
%U A096633 3,5,3,7,5,5,3,3,5,3,3,3,5,3,17,3,5,3,7,13,5,3,11,3,3,5,7,3,3,5,3,7,3,7,5,3
%N A096633 Let p = n-th prime == 3 mod 8 (A007520); a(n) = smallest prime q such that p is not a square mod q.
%t A096633 f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Select[ Prime[ Range[435]], Mod[ #, 8] == 3 &]
%K A096633 nonn
%O A096633 1,1
%A A096633 _Robert G. Wilson v_, Jun 24 2004