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
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<p-1), m=max(m, (j^2)%p); j++); if((m-k)<=0, v=concat(v, p-m)); k=m); print(v) }
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Ferenc Adorjan (fadorjan(AT)freemail.hu), Sep 22 2003
STATUS
approved