|
|
A323594
|
|
Primes p such that 3 is a primitive root modulo p while 27 is not.
|
|
2
|
|
|
7, 19, 31, 43, 79, 127, 139, 163, 199, 211, 223, 283, 331, 379, 463, 487, 571, 607, 631, 691, 739, 751, 811, 823, 859, 907, 1039, 1063, 1087, 1123, 1231, 1279, 1291, 1327, 1423, 1447, 1459, 1483, 1567, 1579, 1627, 1663, 1699, 1723, 1747, 1831, 1951, 1987, 1999
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Primes p such that 3 is a primitive root modulo p (i.e., p is in A019334) and that p == 1 (mod 3).
According to Artin's conjecture, the number of terms <= N is roughly ((2/5)*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).
|
|
LINKS
|
|
|
PROG
|
(PARI) forprime(p=5, 2000, if(znorder(Mod(3, p))==(p-1) && p%3==1, print1(p, ", ")))
|
|
CROSSREFS
|
Primes p such that 3 is a primitive root modulo p and that p == 1 (mod q): this sequence (q=3), A323617 (q=5), A323628 (q=7).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|