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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020649 Least quadratic nonresidue of n. 7
2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 5, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 5, 5, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 7, 2, 5, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 5, 2, 2, 5, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

3,1

COMMENTS

a(n) is the smallest q such that the congruence x^2 == q (mod n) has no solution 0 < x < n, for n > 2. Note that a(n) is a prime. If n is an odd prime p, then a(p) is the smallest base b such that b^((p-1)/2) == -1 (mod p), see A053760. - Thomas Ordowski, Apr 24 2019

LINKS

Table of n, a(n) for n=3..110.

Eric Weisstein's World of Mathematics, Quadratic Nonresidue

FORMULA

a(prime(n)) = A053760(n) for n > 1. - Thomas Ordowski, Apr 24 2019

PROG

(PARI) residue(n, m)={local(r); r=0; for(i=0, floor(m/2), if(i^2%m==n, r=1)); r}

A020649(n)={local(r, m); r=0; m=0; while(r==0, m=m+1; if(!residue(m, n), r=1)); m} \\ Michael B. Porter, Apr 30 2010

CROSSREFS

Cf. A053760.

Sequence in context: A231727 A270616 A304523 * A183024 A067131 A094915

Adjacent sequences:  A020646 A020647 A020648 * A020650 A020651 A020652

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 03:57 EDT 2020. Contains 337264 sequences. (Running on oeis4.)