OFFSET
1,2
LINKS
Joerg Arndt, Table of n, a(n) for n = 1..10000
Stephen D. Cohen, Tim Trudgian, On the least square-free primitive root modulo p, arXiv:1602.02440 [math.NT], (7-February-2016)
MATHEMATICA
Reap[For[p = 2, p<10^3, p = NextPrime[p], s = Select[PrimitiveRootList[p], SquareFreeQ]; Sow[If[s == {}, 0, First[s]]]]][[2, 1]] (* Jean-François Alcover, Sep 03 2016 *)
PROG
(PARI) forprime(p=2, 10^3, for(g=1, p-1, if(issquarefree(g)&&znorder(Mod(g, p))==p-1, print1(g, ", "); break)));
CROSSREFS
KEYWORD
nonn
AUTHOR
Joerg Arndt, Feb 09 2016
STATUS
approved