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 A094929 #9 May 06 2019 06:15:35
%S A094929 3,5,3,5,3,7,3,3,7,5,3,5,3,3,3,7,5,3,5,11,3,3,5,3,5,3,11,3,5,3,3,7,3,
%T A094929 11,5,5,3,3,3,7,3,5,3,7,11,5,3,7,3,3,7,3,3,3,3,7,5,3,5,3,5,3,5,3,13,5,
%U A094929 3,7,3,3,5,5,13,3,3,5,3,7,3,13,3,5,7,3,3,5,3,5,3,3,5,3,13,3,3,3,5,11,5
%N A094929 Let p = n-th prime; a(n) = smallest odd prime q such that p is not a square mod q.
%t A094929 f[n_] := Block[{k = 2}, While[ JacobiSymbol[n, Prime[k]] == 1, k++ ]; Prime[k]]; f /@ Prime[Range[3, 100]] (* _Robert G. Wilson v_, Jun 24 2004 *)
%o A094929 (PARI) a(n) = {my(p=prime(n), q=3); while (!issquare(Mod(p, q)), q = nextprime(q+1)); q;} \\ _Michel Marcus_, May 06 2019
%Y A094929 Cf. A094928, A096633, A096634, A096635.
%K A094929 nonn
%O A094929 3,1
%A A094929 _N. J. A. Sloane_, Jun 19 2004