The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A071894 Largest positive primitive root (
 1, 2, 3, 5, 8, 11, 14, 15, 21, 27, 24, 35, 35, 34, 45, 51, 56, 59, 63, 69, 68, 77, 80, 86, 92, 99, 101, 104, 103, 110, 118, 128, 134, 135, 147, 146, 152, 159, 165, 171, 176, 179, 189, 188, 195, 197, 207, 214, 224, 223, 230, 237, 234, 248, 254, 261, 267, 269, 272 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 REFERENCES M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 864. R. Osborn, Tables of All Primitive Roots of Odd Primes Less Than 1000, Univ. Texas Press, 1961. LINKS T. D. Noe, Table of n, a(n) for n=1..10000 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy]. FORMULA a(n)=prime(n)-A002199(n) - T. D. Noe, Oct 24 2005 MATHEMATICA f[n_] := Block[{k = Prime[n] - 1, p = Prime[n], t = Table[i, {i, 1, Prime[n] - 1}]}, While[ Union[ PowerMod[ k, t, p]] != t, k-- ]; k]; Table[ f[n], {n, 1, 60}] PROG (PARI) forprime(i=2, 600, p=0; for(q=1, i-1, if(znorder(Mod(q, i))==eulerphi(i), p=q)); print1(p", ")) /* V. Raman, Nov 22 2012 */ CROSSREFS A diagonal of triangle in A060749. Sequence in context: A171048 A209292 A185371 * A301892 A271876 A078444 Adjacent sequences:  A071891 A071892 A071893 * A071895 A071896 A071897 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Jun 11, 2002 EXTENSIONS More terms from Robert G. Wilson v, Jun 11 2002 STATUS approved

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

Last modified February 24 10:11 EST 2020. Contains 332209 sequences. (Running on oeis4.)