来自在线整数百科全书的问候语!http://oeis.org/ Search: id:a268616 Showing 1-1 of 1 %I A268616 %S A268616 1,2,2,3,2,2,3,2,5,2,3,2,6,3,5,2,2,2,2,7,5,3,2,3,5,2,5,2,6,3,3,2,3,2, %T A268616 2,6,5,2,5,2,2,2,19,5,2,3,2,3,2,6,3,7,7,6,3,5,2,6,5,3,3,2,5,17,10,2,3, %U A268616 10,2,2,3,7,6,2,2,5,2,5,3,21,2,2,7,5,15,2,3,13,2,3,2,13,3,2,7,5,2,3,2,2,2,2,2,3,3 %N A268616 Least squarefree primitive root of the n-th prime. %H A268616 Joerg Arndt,n,a(n)n=1…10000的表%H A268616 Stephen D. Cohen,Tim Trudgian,关于最小二乘自由原根模P, arXiv:1602.02440 [math.NT], (7-February-2016) %t A268616 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 *) %o A268616 (PARI) forprime(p=2,10^3,for(g=1,p-1,if(issquarefree(g)&&znorder(Mod(g,p))==p-1,print1(g,", ");break))); %Y A268616 Cf. A001918. %K A268616 nonn %O A268616 1,2 %A A268616 _Joerg Arndt_, Feb 09 2016 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE