|
| |
|
|
A060084
|
|
a(n) is the least prime not a primitive root of n-th prime.
|
|
1
| |
|
|
2, 3, 5, 2, 3, 3, 2, 5, 2, 5, 2, 3, 2, 2, 2, 7, 3, 3, 3, 2, 2, 2, 3, 2, 2, 5, 2, 3, 2, 2, 2, 3, 2, 5, 5, 2, 2, 5, 2, 13, 3, 3, 2, 2, 7, 2, 5, 2, 3, 2, 2, 2, 2, 2, 2, 2, 5, 2, 2, 2, 2, 17, 2, 2, 2, 7, 2, 2, 3, 3, 2, 2, 2, 3, 5, 2, 5, 2, 2, 2, 3, 3, 2, 2, 2, 3, 2, 2, 5, 2, 3, 2, 2, 3, 2, 2, 5, 2, 3, 3, 3, 7, 3, 2, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| a(8)=5 because 19 is the 8th prime, primes 2 and 3 are primitive roots of 19, but 5 is not.
|
|
|
MAPLE
| with(numtheory); for n from 1 to 100 do i := 1; while (i < n) and (primroot(ithprime(i) - 1, ithprime(n)) = ithprime(i)) do i := i+1; od; print( ithprime(i)); od:
|
|
|
CROSSREFS
| Cf. A000040, A060085.
Sequence in context: A065996 A133906 A133907 * A138182 A167835 A102044
Adjacent sequences: A060081 A060082 A060083 * A060085 A060086 A060087
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Marc LeBrun (mlb(AT)well.com), Feb 23 2001
|
|
|
EXTENSIONS
| Corrected by Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Mar 14 2001. Checked by N. J. A. Sloane (njas(AT)research.att.com) Sep 03 2002.
|
| |
|
|
