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!)
 A232928 a(n) is the smallest q such that the primes<=q generate the multiplicative group modulo n. 2
 2, 3, 2, 5, 3, 5, 2, 3, 2, 7, 2, 3, 7, 5, 3, 5, 2, 11, 5, 7, 5, 13, 2, 5, 2, 5, 2, 11, 3, 5, 5, 3, 3, 7, 2, 3, 7, 11, 3, 11, 3, 7, 7, 5, 5, 13, 3, 3, 5, 5, 2, 5, 3, 11, 5, 3, 2, 13, 2, 3, 5, 5, 3, 7, 2, 5, 5, 19, 7, 13, 5, 5, 7, 7, 3, 7, 3, 11, 2, 5, 2, 13, 3, 3, 5, 7, 3, 11, 3, 5, 11, 5, 7, 13, 5, 3, 5, 11, 2, 7, 3, 11, 13, 3, 2, 7, 3, 7, 11, 11, 3, 13, 7, 7, 7, 11, 11, 17 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 LINKS E. Bach and L. Huelsbergen, Statistical evidence for small generating sets, Math. Comp. 61 (1993) 69-82. S. R. Finch, Average least nonresidues, December 4, 2013. [Cached copy, with permission of the author] P. Pollack, The average least quadratic nonresidue modulo m and other variations on a theme of Erdos, J. Number Theory 132 (2012) 1185-1202. CROSSREFS Sequence in context: A131470 A255709 A285512 * A323021 A026235 A086281 Adjacent sequences:  A232925 A232926 A232927 * A232929 A232930 A232931 KEYWORD nonn AUTHOR Steven Finch, Dec 02 2013 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.

Last modified July 30 08:44 EDT 2021. Contains 346352 sequences. (Running on oeis4.)