cp's OEIS Frontend

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.

A192578 Primes p for which there is no prime q == 1 (mod 4) that is smaller than p and is a quadratic residue modulo p.

This page as a plain text file.
%I A192578 #13 Nov 21 2013 13:11:56
%S A192578 2,3,5,7,13,37
%N A192578 Primes p for which there is no prime q == 1 (mod 4) that is smaller than p and is a quadratic residue modulo p.
%C A192578 Gica proved that if p is a prime different from 2, 3, 5, 7, 13, 37, then there exists a prime q < p which is a quadratic residue modulo p and q == 1 (mod 4).
%D A192578 A. Gica, Quadratic residues of certain types, Rocky Mt. J. Math. 36 (2006), 1867-1871.
%H A192578 A. Gica, <a href="http://atlas-conferences.com/cgi-bin/abstract/cbcw-66">Quadratic residues of certain types</a>, Journées Arithmétiques 2011.
%e A192578 p = 7 is a member, because the only prime q < p with q == 1 (mod 4) is q = 5, but 5 is not a quadratic residue modulo 7.
%e A192578 11 is not a member, because 11 > 5 == 1 (mod 4) and 5 == 4^2 (mod 11).
%t A192578 maxPrimePi = 100; nextPrime[q_] := If[q1 = NextPrime[q]; Mod[q1, 4] != 1, nextPrime[q1], q1]; foundQ[p_] := (q = 2; found = False; While[q < p, q = nextPrime[q]; If[JacobiSymbol[q, p] == 1, found = True; Break[]]]; found); Select[ Prime[ Range[ maxPrimePi]], Not[foundQ[#]] &] (* _Jean-François Alcover_, Oct 18 2011 *)
%Y A192578 Cf. A192579.
%K A192578 nonn,fini,full
%O A192578 1,1
%A A192578 _Jonathan Sondow_, Jul 04 2011