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!)
A232928 a(n) is the smallest q such that the primes<=q generate the multiplicative group modulo n. 2

%I #9 Jun 03 2017 15:31:00

%S 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,

%T 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,

%U 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

%N a(n) is the smallest q such that the primes<=q generate the multiplicative group modulo n.

%H E. Bach and L. Huelsbergen, <a href="http://dx.doi.org/10.1090/S0025-5718-1993-1195432-5 ">Statistical evidence for small generating sets</a>, Math. Comp. 61 (1993) 69-82.

%H S. R. Finch, <a href="/A232927/a232927.pdf">Average least nonresidues</a>, December 4, 2013. [Cached copy, with permission of the author]

%H P. Pollack, <a href="http://dx.doi.org/10.1016/j.jnt.2011.12.015">The average least quadratic nonresidue modulo m and other variations on a theme of Erdos</a>, J. Number Theory 132 (2012) 1185-1202.

%K nonn

%O 3,1

%A _Steven Finch_, Dec 02 2013

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 April 25 10:51 EDT 2024. Contains 371967 sequences. (Running on oeis4.)