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!)
 A091385 Distance (A091382) of primes from the largest quadratic "mixed" residues modulo the primes (A091380), where the latter is non-monotonic. 5

%I

%S 2,7,11,7,11,11,7,17,7,7,7,13,11,13,7,11,7,11,13,7,11,13,11,7,11,11,

%T 13,7,7,11,13,19,11,17,11,7,7,7,13,13,17,11,11,17,11,13,19,11,13,11,7,

%U 7,11,19,11,11,7,13,11,11,13,13,7,13,17,13,11,17,11,19,11,11,11,13,23,7,17,7

%N Distance (A091382) of primes from the largest quadratic "mixed" residues modulo the primes (A091380), where the latter is non-monotonic.

%C For n > 1, the values are some odd primes, but never < 7. The maximum value increases very slowly, it only reaches 43 for the first 10^5 primes.

%H Ferenc Adorjan, <a href="http://web.axelero.hu/fadorjan/qrp.pdf">The sequence of largest quadratic residues modulo the primes</a>

%o (PARI) {/* The distance of LQxR from the primes where the sequence of the largest "mixed" QR modulo the primes is non-monotonic */ lqxr_nm_pd(to)=local(v=[],k,r,q,p,e=1,n=0,i=1); while(n<to,i+=1;p=prime(i);k=p-1;r=p%4-2; while(kronecker(k,p)<>r,k-=1); if(k-e<=0,v=concat(v,p-k);n+=1);e=k); print(i);print(v) }

%Y Cf. A091380, A091381, A091382, A091383, A091384, A088195, A088201.

%K easy,nonn

%O 1,1

%A Ferenc Adorjan (fadorjan(AT)freemail.hu)

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 23 01:30 EDT 2021. Contains 347609 sequences. (Running on oeis4.)