OFFSET
1,2
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
f:=proc(n) local p, k;
p:= ithprime(n);
for k from p-1 to 1 by -1 do
if numtheory:-order(k, p) = p-1 and isprime(k) then return k fi
od;
0
end proc;
map(f, [$1..100]); # Robert Israel, Apr 11 2021
MATHEMATICA
Reap[For[p = 2, p<1000, p = NextPrime[p], s = Select[PrimitiveRootList[p], PrimeQ]; Sow[If[s == {}, 0, Last[s]]]]][[2, 1]] (* Jean-François Alcover, Sep 03 2016 *)
PROG
(PARI) forprime(i=2, 600, p=0; for(q=1, i-1, if(znorder(Mod(q, i))==eulerphi(i)&&isprime(q), p=q)); print1(p", "))
CROSSREFS
KEYWORD
nonn
AUTHOR
V. Raman, Nov 19 2012
STATUS
approved