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

2, 3, 5, 7, 11, 13

Offset

1,1

Comments

Gica proved that if p is a prime different from 2, 3, 5, 7, 11, 13, then a prime q < p exists which is a quadratic residue modulo p and q == 1 (mod 3). His paper has not yet been published, but see A192578 for a reference, link, and examples of a similar result.

Links

Table of n, a(n) for n=1..6.

Mathematica

piMax = 100; quadQ[q_, p_] := Length[ Select[ Table[x^2, {x, 1, Floor[p/2]}], Mod[#, p] == q & , 1]] == 1; noPrimeQ[p_] := Select[ Table[ Prime[n], {n, 1, PrimePi[p]}], Mod[#, 3] == 1 && quadQ[#, p] &] === {}; Select[ Table[ Prime[n], {n, 1, piMax}], noPrimeQ] (* Jean-François Alcover, Oct 03 2011 *)

Crossrefs

Cf. A192578, A192579, A193064.

Sequence in context: A241506 A361851 A165132 * A039715 A039714 A039713

Adjacent sequences: A193060 A193061 A193062 * A193064 A193065 A193066

Keyword

nonn,fini,full

Author

Jonathan Sondow, Jul 15 2011

Status

approved