OFFSET
1,1
COMMENTS
Alternatively, primes such that the least positive primitive root is greater than the square root of p.
Next term is greater than 10^9.
REFERENCES
References and links at A001918.
EXAMPLE
The least primitive root of 23 is 5; 5^2 is greater than 23, so 23 is in the sequence.
The least primitive root of 409 is 21; 21^2 = 441 is greater than 409, so 409 is in the sequence.
41 is not in the sequence because its least primitive root is 6, and 6^2 < 41.
MATHEMATICA
Select[Prime[Range[1000]], PrimitiveRoot[#]^2 > # &]
PROG
(PARI) /* the following assumes that znprimroot() returns the smallest primitive root */
forprime(p=2, 10^9, my(g=znprimroot(p)); if(lift(g)^2>p, print1(p, ", "))); \\ Joerg Arndt, Sep 17 2015
(Python)
from itertools import islice, count
from sympy import prime, primitive_root
def A262264_gen(): # generator of terms
return filter(lambda p: p < primitive_root(p)**2, (prime(n) for n in count(1)))
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Dale Taylor, Sep 17 2015
STATUS
approved