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 A019421 #16 Dec 03 2019 18:51:35 %S A019421 2,17,23,41,47,59,67,71,73,101,103,109,149,173,179,191,197,199,223, %T A019421 233,241,251,277,293,311,331,337,349,367,373,379,383,409,419,443,457, %U A019421 461,467,499,541,557,569,587,593,599,613,619,631,643,673,677,683,691,719,733,761 %N A019421 Primes with primitive root 99. %C A019421 To allow primes less than the specified primitive root m (here, 99) to be included, we use the essentially equivalent definition "Primes p such that the multiplicative order of m mod p is p-1". This comment applies to all of A019334-A019421. - _N. J. A. Sloane_, Dec 03 2019 %H A019421 Vincenzo Librandi, <a href="/A019421/b019421.txt">Table of n, a(n) for n = 1..1000</a> %H A019421 <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a> %t A019421 pr=99; Select[Prime[Range[200]], MultiplicativeOrder[pr, # ] == #-1 &] %K A019421 nonn %O A019421 1,1 %A A019421 _David W. Wilson_