Smallest prime p == 3 (mod 4) such that all of 2,3,5,...,prime(n) are primitive roots mod p
trizend5b49d04aamodified: oeis-research/Paul Vanderveen/Smallest prime p == 3 (mod 4) such that all of 2,3,5,...,prime(n) are primitive roots mod p/search.pl
d5b49d04aa
modified: oeis-research/Paul Vanderveen/Smallest prime p == 3 (mod 4) such that all of 2,3,5,...,prime(n) are primitive roots mod p/search.pl
trizen
d5b49d04aa
modified: oeis-research/Paul Vanderveen/Smallest prime p == 3 (mod 4) such that all of 2,3,5,...,prime(n) are primitive roots mod p/search.pl