This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A071894 #28 Jul 02 2025 19:30:09
%S A071894 1,2,3,5,8,11,14,15,21,27,24,35,35,34,45,51,56,59,63,69,68,77,80,86,
%T A071894 92,99,101,104,103,110,118,128,134,135,147,146,152,159,165,171,176,
%U A071894 179,189,188,195,197,207,214,224,223,230,237,234,248,254,261,267,269,272
%N A071894 Largest positive primitive root (<p) of n-th prime p.
%D A071894 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.
%D A071894 R. Osborn, Tables of All Primitive Roots of Odd Primes Less Than 1000, Univ. Texas Press, 1961.
%H A071894 T. D. Noe, <a href="/A071894/b071894.txt">Table of n, a(n) for n=1..10000</a>
%H A071894 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%F A071894 a(n) = prime(n) - A002199(n) - _T. D. Noe_, Oct 24 2005
%t A071894 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}]
%o A071894 (PARI) a(n) = my(p=prime(n)); forstep(q=p-1, 1, -1, if(znorder(Mod(q, p))==eulerphi(p), return(q))); \\ _Michel Marcus_, Sep 28 2023
%Y A071894 A diagonal of triangle in A060749.
%Y A071894 Cf. A000040, A001918 (least positive primitive root), A002199.
%K A071894 nonn,easy
%O A071894 1,2
%A A071894 _N. J. A. Sloane_, Jun 11 2002
%E A071894 More terms from _Robert G. Wilson v_, Jun 11 2002