login
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
OFFSET
1,1
COMMENTS
a(prime(n)) = A122028(n).
LINKS
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
Sequence in context: A256368 A057019 A084740 * A204895 A064652 A077600
KEYWORD
nonn,easy
AUTHOR
Eric M. Schmidt, Sep 27 2013
STATUS
approved