cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A079061 Smallest prime p such that the least positive primitive root of p equals prime(n).

Original entry on oeis.org

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
Offset: 1

Views

Author

Benoit Cloitre, Feb 02 2003

Keywords

Comments

Smallest prime(m) such that A001918(m) = prime(n). (Corrected by Jonathan Sondow, Feb 03 2013)
a(36) = 831143041 and a(34) and a(35) > 1065000000. - Robert G. Wilson v, Jul 03 2003

Crossrefs

Programs

  • 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
  • PARI
    a(n)=if(n<0,0,s=1; while(prime(n)!=lift(znprimroot(prime(s))),s++); prime(s))

Formula

a(n) = A023048(prime(n)). - R. J. Mathar, Aug 03 2018

Extensions

More terms from Robert G. Wilson v, Jul 03 2003