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 A267009 #32 Oct 09 2021 06:57:52
%S A267009 3,7,11,23,47,59,71,79,83,103,107,127,131,139,151,163,167,179,191,199,
%T A267009 211,227,239,251,263,271,283,311,331,347,359,367,383,419,431,439,443,
%U A267009 463,467,479,487,499,503,523,547,563,571,587,599,607,647,659,691,719,727
%N A267009 Primes p for which the average of the primitive roots is > p/2.
%C A267009 It appears that these primes are all congruent to 3 (mod 4).
%H A267009 Amiram Eldar, <a href="/A267009/b267009.txt">Table of n, a(n) for n = 1..10000</a>
%F A267009 a(n) = prime(A266990(n)).
%e A267009 a(2) = 7 since the primitive roots of 7 are 3 and 5 and their average is (3+5)/2 = 8/2 > 7/2.
%t A267009 A = Table[Total[Flatten[Position[Table[MultiplicativeOrder[i, Prime[k]], {i, Prime[k] - 1}], Prime[k] - 1]]]/(EulerPhi[Prime[k] - 1] Prime[k]/2), {k, 1, 1000}]; Prime[Flatten[Position[A, _?(# > 1 &)]]]
%t A267009 Select[Range[1000], PrimeQ[#] && Mean[PrimitiveRootList[#]] > #/2 &] (* _Amiram Eldar_, Oct 09 2021 *)
%Y A267009 Cf. A008330, A060749, A088144, A266990.
%K A267009 nonn
%O A267009 1,1
%A A267009 _Dimitri Papadopoulos_, Jan 08 2016