2050312613

Appears in sequences

• a(n) gives least prime for which the n-th prime is the least prime which is not a primitive root of a(n) (see A060084), or 0 if the n-th prime never occurs in A060084.at n=26A060085
• Increasing sequence of primes p such that all of 2,3,5,...,prime(n) are primitive roots mod p.at n=24A213052
• a(n) is the least prime p = prime(k) > prime(n) such that A306530(k) = prime(n).at n=26A307965