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 A323628 #20 Feb 16 2025 08:33:57 %S A323628 29,43,113,127,197,211,281,379,449,463,617,631,701,953,1373,1709,1723, %T A323628 2129,2143,2213,2311,2381,2549,2633,2647,2731,2801,2969,3137,3389, %U A323628 3557,3571,3823,4159,4229,4243,4327,4397,4481,4649,4663,4817,4831,4999,5237,5419 %N A323628 Primes p such that 3 is a primitive root modulo p while 2187 is not. %C A323628 Primes p such that 3 is a primitive root modulo p (i.e., p is in A019334) and that p == 1 (mod 7). %C A323628 According to Artin's conjecture, the number of terms <= N is roughly ((6/41)*C)*PrimePi(N), where C is the Artin's constant = A005596, PrimePi = A000720. Compare: the number of terms of A001122 that are no greater than N is roughly C*PrimePi(N). %H A323628 Robert Israel, <a href="/A323628/b323628.txt">Table of n, a(n) for n = 1..10000</a> %H A323628 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ArtinsConstant.html">Artin's constant</a> %H A323628 Wikipedia, <a href="https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots">Artin's conjecture on primitive roots</a> %p A323628 select(p -> isprime(p) and numtheory:-order(3,p)=p-1, [seq(i,i=1..10000,7)]); # _Robert Israel_, Sep 01 2019 %o A323628 (PARI) forprime(p=5, 5500, if(znorder(Mod(3, p))==(p-1) && p%7==1, print1(p, ", "))) %Y A323628 Cf. A019334, A005596, A000720. %Y A323628 Primes p such that 3 is a primitive root modulo p and that p == 1 (mod q): A323594 (q=3), A323617 (q=5), this sequence (q=7). %K A323628 nonn %O A323628 1,1 %A A323628 _Jianing Song_, Aug 30 2019