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!)
A133432 Let m = n-th number that is not a perfect power, A007916(n). Then a(n) = smallest prime having least positive primitive root m. 3

%I #14 Aug 04 2018 03:05:26

%S 3,7,23,41,71,313,643,4111,457,1031,439,311,53173,191,107227,409,3361,

%T 2161,533821,12391,133321,15791,124153,5881,268969,48889,64609,36721,

%U 55441,166031,1373989,156601,2494381,95471,71761,95525767

%N Let m = n-th number that is not a perfect power, A007916(n). Then a(n) = smallest prime having least positive primitive root m.

%C a(n) = A023048(A007916(n)).

%H N. J. A. Sloane, <a href="/A133432/b133432.txt">Table of n, a(n) for n=1..94</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>

%Y Cf. A023048, A007916, A001597, A133433 (records).

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Nov 29 2007

%E Definition corrected by _Christopher J. Smyth_, Oct 16 2013

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 June 12 21:26 EDT 2024. Contains 373360 sequences. (Running on oeis4.)