|
| |
|
|
A084735
|
|
Let p = n-th prime, let q = smallest prime having p as its least prime primitive root; sequence gives least (not necessarily prime) primitive root of q.
|
|
2
| |
|
|
2, 3, 5, 6, 6, 13, 17, 19, 10, 21, 10, 14, 6, 6, 6, 6, 38, 12, 6, 22, 6, 10, 69, 6, 44, 6, 35, 10, 14, 33, 6, 10, 10, 18, 14, 6, 33, 14, 33, 18, 94, 15, 38, 15, 22, 6, 6, 6, 6, 6, 6, 12, 14, 22, 10, 14, 57, 22, 12, 15, 6
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| Paszkiewicz, A. and Schinzel, A., On the least prime primitive root modulo a prime, Math. Comp. 71 (2002), no. 239, 1307-1321.
|
|
|
EXAMPLE
| n=4: p = 7, q = 41, 41 has least primitive root 6, so a(4) = 6.
|
|
|
CROSSREFS
| Cf. A084739.
Sequence in context: A128054 A175081 A023834 * A002734 A160100 A113821
Adjacent sequences: A084732 A084733 A084734 * A084736 A084737 A084738
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2003
|
|
|
EXTENSIONS
| More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com) and Don Reble (djr(AT)nk.ca), Jul 03 2003
|
| |
|
|
