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 A377179 #8 Oct 23 2024 20:26:43 %S A377179 5,13,23,29,31,47,53,61,71,79,101,109,149,151,157,167,173,191,197,199, %T A377179 223,229,239,263,269,277,293,311,317,359,367,373,383,389,461,463,479, %U A377179 487,503,509,557,599,613,647,653,661,677,701,709,719,733,743,757,773,797,821,823,829,839,853,863,887,911,967,983,991 %N A377179 Primes p such that -9/2 is a primitive root modulo p. %C A377179 If p is a term in this sequence, then -9/2 is not a square modulo p (i.e., p is in A003628). %C A377179 Conjecture: this sequence has relative density equal to Artin's constant (A005596) with respect to the set of primes. %H A377179 Wikipedia, <a href="https://en.wikipedia.org/wiki/Artin%27s_conjecture_on_primitive_roots">Artin's conjecture on primitive roots</a>. %H A377179 <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a> %o A377179 (PARI) forprime(p=5, 10^3, if(znorder(Mod(-9/2, p))==p-1, print1(p, ", "))); %Y A377179 Primes p such that +a/2 is a primitive root modulo p: A320384 (a=3), A377174 (a=5), A377176 (a=7), A377178 (a=9). %Y A377179 Primes p such that -a/2 is a primitive root modulo p: A377172 (a=3), A377175 (a=5), A377177 (a=7), this sequence (a=9). %Y A377179 Cf. A003628, A005596. %K A377179 nonn,easy %O A377179 1,1 %A A377179 _Jianing Song_, Oct 18 2024