login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206095 a(n) = smallest number congruent to a quadratic non-residue modulo each of the first n odd primes. 0
2, 2, 17, 17, 83, 167, 167, 227, 398, 398, 5297, 64382, 69467, 116387, 214037, 214037, 430022, 5472953, 8062073, 8062073, 41941577, 86374763, 163520117, 163520117, 231912722, 231912722, 231912722, 545559467, 1728061733 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

EXAMPLE

For instance 83, the 5th term, does not differ from any square by any multiple of 3, 5, 7, 11 or 13, unlike all smaller positive integers.

PROG

(PARI) a(n) = {n++; sm = 2; ok = 0; until (ok, ok = 1; for (in = 2, n, p = prime(in); if (kronecker(sm % p, p) != -1, ok = 0; break); ); if (! ok, sm++); ); return(sm); } \\ Michel Marcus, Jul 19 2013

CROSSREFS

Sequence in context: A100680 A002567 A238289 * A222451 A000528 A260478

Adjacent sequences: A206092 A206093 A206094 * A206096 A206097 A206098

KEYWORD

nonn

AUTHOR

Keith F. Lynch, Feb 03 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 27 17:21 EST 2023. Contains 359845 sequences. (Running on oeis4.)