The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088195 Distance (A088192) of primes from the largest quadratic residues modulo the primes (A088190), where the latter is non-monotonic. 7
 3, 3, 3, 7, 3, 3, 3, 7, 3, 11, 7, 3, 7, 11, 3, 11, 7, 3, 3, 3, 3, 7, 17, 7, 3, 3, 3, 3, 3, 3, 13, 3, 11, 3, 7, 3, 11, 3, 3, 3, 3, 3, 13, 3, 11, 3, 3, 3, 3, 3, 11, 7, 11, 13, 3, 7, 7, 11, 7, 3, 3, 11, 19, 3, 11, 3, 3, 11, 17, 3, 11, 3, 7, 3, 13, 3, 3, 3, 3, 11, 11, 3, 3, 3, 3, 13, 19, 3, 3, 3, 7, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The values are some odd primes, but never 5. The maximum value increases very slowly, it only reaches 31 for the first 20000 primes. It is conjectured that if we denote the members of A088194 by D(n) and the member of this sequence by M(n) then if D(n)=-1 then M(n)=7, while if M(n)=3 then D(n)=0. The values are odd primes, but never 5 (the primality is provable). The maximum value increases very slowly: it only reaches 43 for the first 10^5 primes. LINKS Ferenc Adorjan, The sequence of largest quadratic residues modulo the primes. PROG (PARI) qrp_pm_nm(to)= {/* The distance of LQR from the primes where the sequence of the largest QR modulo the primes is non-monotonic */ local(m, k=1, p, v=[]); for(i=2, to, m=1; p=prime(i); j=2; while((j<=(p-1)/2)&&(m

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 24 03:26 EDT 2021. Contains 347623 sequences. (Running on oeis4.)