|
Search: id:A079061
|
|
|
| A079061 |
|
Smallest prime p such that the least positive primitive root of p equals prime(n). |
|
+0
2
|
|
| 3, 7, 23, 71, 643, 457, 311, 191, 2161, 15791, 5881, 36721, 156601, 95471, 275641, 161831, 712321, 1171921, 3384481, 3659401, 760321, 7510801, 16889161, 6366361, 17551561, 29418841, 49443241, 33358081, 67992961, 90441961, 184254841
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Smallest prime p such that A001918(p) = prime(n).
a(36) = 831143041 and a(34) and a(35) > 1065000000. - Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 03 2003
|
|
MATHEMATICA
|
<< NumberTheory`NumberTheoryFunctions`; a = Table[ 0, {36}]; p = 2; Do[p = NextPrime[p]; pr = PrimitiveRoot[p]; If[ PrimeQ[pr] && PrimePi[pr] < 37 && a[[ PrimePi[pr]]] == 0, a[[ PrimePi[ pr]]] = p], {n, 2, 54000000}]; a
|
|
PROGRAM
|
(PARI) a(n)=if(n<0, 0, s=1; while(abs(prime(n)-lift(znprimroot(prime(s)))>0, s++); prime(s))
|
|
CROSSREFS
|
Cf. A001918, A023048, A066529, A084739.
Sequence in context: A062241 A000229 A133435 this_sequence A057184 A104088 A136508
Adjacent sequences: A079058 A079059 A079060 this_sequence A079062 A079063 A079064
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 02 2003
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 03 2003
|
|
|
Search completed in 0.002 seconds
|
