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 A019336 #18 Dec 03 2019 18:48:16 %S A019336 11,13,17,41,59,61,79,83,89,103,107,109,113,127,131,137,151,157,179, %T A019336 199,223,227,229,233,251,257,271,277,347,367,373,397,401,419,443,449, %U A019336 467,487,491,521,563,569,587,593,613,641,659,661,683,709,733,757,761,809,823,827 %N A019336 Primes with primitive root 6. %C A019336 To allow primes less than the specified primitive root m (here, 6) 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 A019336 Vincenzo Librandi, <a href="/A019336/b019336.txt">Table of n, a(n) for n = 1..1000</a> %H A019336 <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a> %t A019336 pr=6; Select[Prime[Range[200]], MultiplicativeOrder[pr, # ] == #-1 &] %K A019336 nonn %O A019336 1,1 %A A019336 _David W. Wilson_