A232927 a(n) is the smallest k such that the first k primes generate the multiplicative group modulo n.

1, 2, 1, 3, 2, 3, 1, 2, 1, 4, 1, 2, 4, 3, 2, 3, 1, 5, 3, 4, 3, 6, 1, 3, 1, 3, 1, 5, 2, 3, 3, 2, 2, 4, 1, 2, 4, 5, 2, 5, 2, 4, 4, 3, 3, 6, 2, 2, 3, 3, 1, 3, 2, 5, 3, 2, 1, 6, 1, 2, 3, 3, 2, 4, 1, 3, 3, 8, 4, 6, 3, 3, 4, 4, 2, 4, 2, 5, 1, 3, 1, 6, 2, 2, 3, 4, 2, 5, 2, 3, 5, 3, 4, 6, 3, 2, 3, 5, 1, 4, 2, 5, 6, 2, 1, 4, 2, 4, 5, 5, 2, 6, 4, 4, 4, 5, 5, 7

Offset

3,2

Links

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

H. Brown and H. Zassenhaus, Some empirical observations on primitive roots, J. Number Theory 3 (1971) 306-309.

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

Cf. A098990, A249270.

Sequence in context: A287730 A260452 A005679 * A350651 A275832 A237839

Adjacent sequences: A232924 A232925 A232926 * A232928 A232929 A232930

Keyword

nonn

Author

Steven Finch, Dec 02 2013

Status

approved