|
Search: id:A084739
|
|
|
| A084739 |
|
Let p = n-th prime, then a(n) = smallest prime having p as its least prime primitive root. |
|
+0
4
|
|
| 3, 7, 23, 41, 109, 457, 311, 191, 2137, 409, 1021, 1031, 1811, 271, 14293, 2791, 55441, 35911, 57991, 221101, 23911, 11971, 110881, 103091, 71761, 513991, 290041, 31771, 448141, 2447761, 674701, 3248701, 2831011, 690541, 190321, 2080597, 4076641
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Smallest prime p such that A002233(p) = prime(n).
|
|
REFERENCES
|
Paszkiewicz, A. and Schinzel, A., On the least prime primitive root modulo a prime, Math. Comp. 71 (2002), no. 239, 1307-1321.
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n=1..97 (from the web page of Tomas Oliveira e Silva)
Tomas Oliveira e Silva, Least primitive root of prime numbers
|
|
CROSSREFS
|
Cf. A084735, A001918, A079061. For records see A133434.
Sequence in context: A133432 A133433 A029932 this_sequence A133434 A122870 A079477
Adjacent sequences: A084736 A084737 A084738 this_sequence A084740 A084741 A084742
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, 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
|
|
|
Search completed in 0.002 seconds
|
