|
| |
|
|
A060085
|
|
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.
|
|
1
| |
|
|
2, 3, 5, 53, 773, 173, 293, 2477, 22613, 9173, 61613, 280013, 92333, 74093, 170957, 360293, 679733, 36300197, 2004917, 69009533
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Note that these are the smallest primes such that exactly the first n primes are primitive roots.
a(n) gives the prime corresponding to the first appearance of the n-th prime in A060084. The n-th prime is the least prime not a primitive root of a(n) and for all primes p < a(n) the n-th prime (i.e. A000040(n)) is either a primitive root of p, or else there is a smaller prime q which is not a primitive root of a(n). Question: does a value exist for all primes?
|
|
|
EXAMPLE
| a(4)=23 because the first occurrence of 7 in A060084 is at n=9 and the 9th prime, A000040(9)=23. That is, a(4)=23 since the 4-th prime, A000040(4), is 7 and 23 is the smallest prime p for which 7 is the least prime that is not a primitive root of p.
|
|
|
CROSSREFS
| Cf. A000040, A060084.
Sequence in context: A041791 A056720 A100850 * A114370 A114725 A136340
Adjacent sequences: A060082 A060083 A060084 * A060086 A060087 A060088
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Marc LeBrun (mlb(AT)well.com), Feb 23 2001
|
|
|
EXTENSIONS
| Corrected by Jud McCranie Sep 03 2002.
|
| |
|
|
