A084739 -id:A084739 - cp's OEIS frontend

A133434 Records in A084739.

3, 7, 23, 41, 109, 457, 2137, 14293, 55441, 57991, 221101, 513991, 2447761, 3248701, 4076641, 11643607, 16135981, 25400761, 25738831, 399263281, 741488749, 794932741, 5516118301, 9237839521, 10453202761, 20833333501

Offset: 1

N. J. A. Sloane, Nov 29 2007

nonn

N. J. A. Sloane, Table of n, a(n) for n=1..34 (from the web page of Tomás Oliveira e Silva)
Tomás Oliveira e Silva, Least primitive root of prime numbers

A084735 Let p = n-th prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.

Original entry on oeis.org

2, 3, 5, 6, 6, 13, 17, 19, 10, 21, 10, 14, 6, 6, 6, 6, 38, 12, 6, 22, 6, 10, 69, 6, 44, 6, 35, 10, 14, 33, 6, 10, 10, 18, 14, 6, 33, 14, 33, 18, 94, 15, 38, 15, 22, 6, 6, 6, 6, 6, 6, 12, 14, 22, 10, 14, 57, 22, 12, 15, 6

Offset: 1

N. J. A. Sloane, Jul 03 2003

			n=4: p = 7, q = 41, 41 has least primitive root 6, so a(4) = 6.

A. Paszkiewicz and A. Schinzel, On the least prime primitive root modulo a prime, Math. Comp. 71 (2002), no. 239, 1307-1321.

Cf. A084739.

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and Don Reble, Jul 03 2003

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

Benoit Cloitre, Feb 02 2003

nonn

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

Cf. A001918, A023048, A066529, A084739.

<< 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

a(n)=if(n<0,0,s=1; while(prime(n)!=lift(znprimroot(prime(s))),s++); prime(s))

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

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

cp's OEIS Frontend

A133434 Records in A084739.

Views

Author

Keywords

Links

A084735 Let p = n-th prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

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

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions