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

%I #21 Aug 04 2018 02:52:31

%S 3,7,23,41,109,457,311,191,2137,409,1021,1031,1811,271,14293,2791,

%T 55441,35911,57991,221101,23911,11971,110881,103091,71761,513991,

%U 290041,31771,448141,2447761,674701,3248701,2831011,690541,190321,2080597,4076641

%N Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root.

%C Smallest prime(m) such that A002233(m) = prime(n). (Corrected by _Jonathan Sondow_, Feb 02 2013)

%H N. J. A. Sloane, <a href="/A084739/b084739.txt">Table of n, a(n) for n=1..97</a> (from the web page of Tomás Oliveira e Silva)

%H Tomás Oliveira e Silva, <a href="http://sweet.ua.pt/tos/p_roots.html">Least primitive root of prime numbers</a>

%H A. Paszkiewicz and A. Schinzel, <a href="https://doi.org/10.1090/S0025-5718-02-01370-4">On the least prime primitive root modulo a prime</a>, Math. Comp. 71 (2002), no. 239, 1307-1321.

%Y Cf. A084735, A001918, A079061. For records see A133434.

%K nonn,easy

%O 1,1

%A _N. J. A. Sloane_, Jul 03 2003

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and _Don Reble_, Jul 03 2003

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 April 24 03:05 EDT 2024. Contains 371918 sequences. (Running on oeis4.)