The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A084739 Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root. 4
3, 7, 23, 41, 109, 457, 311, 191, 2137, 409, 1021, 1031, 1811, 271, 14293, 2791, 55441, 35911, 57991, 221101, 23911, 11971, 110881, 103091, 71761, 513991, 290041, 31771, 448141, 2447761, 674701, 3248701, 2831011, 690541, 190321, 2080597, 4076641 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Smallest prime(m) such that A002233(m) = prime(n). (Corrected by Jonathan Sondow, Feb 02 2013)
LINKS
N. J. A. Sloane, Table of n, a(n) for n=1..97 (from the web page of Tomás Oliveira e Silva)
Tomás Oliveira e Silva, Least primitive root of prime numbers
A. Paszkiewicz and A. Schinzel, On the least prime primitive root modulo a prime, Math. Comp. 71 (2002), no. 239, 1307-1321.
CROSSREFS
Cf. A084735, A001918, A079061. For records see A133434.
Sequence in context: A133432 A133433 A029932 * A133434 A122870 A216816
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 03 2003
EXTENSIONS
More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and Don Reble, Jul 03 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 22:36 EDT 2024. Contains 372954 sequences. (Running on oeis4.)