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 A091382 #2 Jun 01 2010 03:00:00
%S A091382 1,2,2,3,2,2,3,2,5,2,3,2,3,2,5,2,2,2,2,7,5,3,2,3,5,2,3,2,2,3,3,2,3,2,
%T A091382 2,3,2,2,5,2,2,2,7,5,2,3,2,3,2,2,3,7,7,2,3,5,2,3,2,3,2,2,2,11,5,2,2,5,
%U A091382 2,2,3,7,3,2,2,5,2,2,3,7,2,2,7,5,3,2,3,5,2,3,2,13,3,2,2,5,2,3,2,2
%N A091382 Distance between the sequence of primes and the largest "mixed" quadratic residues modulo the primes (A091380).
%C A091382 Apart from the first term, it contains solely primes. Is every prime in there?
%C A091382 Apart from the first term and the definition, it is identical to the sequence A053760 by S. R. Finch.
%H A091382 Ferenc Adorjan, <a href="http://web.axelero.hu/fadorjan/qrp.pdf">The sequence of largest quadratic residues modulo the primes</a>
%o A091382 (PARI) {/* Distance of primes from the sequence of the largest "mixed" QR modulo the primes */ p_lqxr(to)=local(v=[1],k,r,q,p); for(i=2,to,p=prime(i);k=p-1;r=p%4-2; while(kronecker(k,p)<>r,k-=1); v=concat(v,p-k)); print(v) }
%Y A091382 Cf. A091380, A091381, A091383, A091384, A091385, A088192, A088198.
%K A091382 easy,nonn
%O A091382 1,2
%A A091382 Ferenc Adorjan (fadorjan(AT)freemail.hu)