OFFSET
1,1
COMMENTS
According to the conjecture in A232748, this sequence should contain infinitely many primes.
LINKS
Zhi-Wei Sun, Table of n, a(n) for n = 1..10000
EXAMPLE
a(3) = 5 since 5 is prime with pi(5) = 3 a primitive root modulo 5.
MATHEMATICA
dv[n_]:=Divisors[n]
n=0; Do[Do[If[Mod[k^(Part[dv[Prime[k]-1], j]), Prime[k]]==1, Goto[aa]], {j, 1, Length[dv[Prime[k]-1]]-1}]; n=n+1; Print[n, " ", Prime[k]]; Label[aa]; Continue, {k, 1, 166}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, May 21 2014
STATUS
approved