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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A229708 Least prime of maximal order mod n. 3
 2, 3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 5, 2, 3, 2, 3, 3, 5, 2, 3, 2, 7, 5, 5, 2, 7, 2, 3, 2, 7, 3, 3, 2, 3, 2, 5, 2, 3, 2, 3, 7, 5, 3, 3, 2, 5, 5, 5, 3, 3, 5, 7, 2, 5, 2, 3, 2, 3, 2, 7, 2, 3, 2, 3, 2, 5, 2, 3, 2, 3, 7, 5, 5, 5, 2, 3, 2, 7, 3, 3, 2, 7, 2, 5, 3, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(prime(n)) = A122028(n). LINKS Eric M. Schmidt, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A111076(n) if and only if A111076(n) is prime. - Jonathan Sondow, May 17 2017 PROG (Sage) def A229708(n) : m = Integers(n).unit_group_exponent(); return next(p for p in Primes() if n%p != 0 and mod(p, n).multiplicative_order() == m) CROSSREFS Cf. A111076, A122028. Sequence in context: A256368 A057019 A084740 * A204895 A064652 A077600 Adjacent sequences:  A229705 A229706 A229707 * A229709 A229710 A229711 KEYWORD nonn,easy AUTHOR Eric M. Schmidt, Sep 27 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 20:51 EDT 2022. Contains 354092 sequences. (Running on oeis4.)