This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A229708 #12 May 17 2017 11:27:23 %S A229708 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, %T A229708 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, %U A229708 2,3,7,5,5,5,2,3,2,7,3,3,2,7,2,5,3,3,2 %N A229708 Least prime of maximal order mod n. %C A229708 a(prime(n)) = A122028(n). %H A229708 Eric M. Schmidt, <a href="/A229708/b229708.txt">Table of n, a(n) for n = 1..10000</a> %F A229708 a(n) = A111076(n) if and only if A111076(n) is prime. - _Jonathan Sondow_, May 17 2017 %o A229708 (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) %Y A229708 Cf. A111076, A122028. %K A229708 nonn,easy %O A229708 1,1 %A A229708 _Eric M. Schmidt_, Sep 27 2013