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

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

Offset

3,1

Links

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

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: A352708 A255709 A285512 * A323021 A026235 A086281

Adjacent sequences: A232925 A232926 A232927 * A232929 A232930 A232931

Keyword

nonn

Author

Steven Finch, Dec 02 2013

Status

approved