A229708 - OEIS

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

A229708

Least prime of maximal order mod n.

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