|
|
A127807
|
|
Least positive primitive root of (n-th prime)^2.
|
|
4
|
|
|
3, 2, 2, 3, 2, 2, 3, 2, 5, 2, 3, 2, 6, 3, 5, 2, 2, 2, 2, 7, 5, 3, 2, 3, 5, 2, 5, 2, 6, 3, 3, 2, 3, 2, 2, 6, 5, 2, 5, 2, 2, 2, 19, 5, 2, 3, 2, 3, 2, 6, 3, 7, 7, 6, 3, 5, 2, 6, 5, 3, 3, 2, 5, 17, 10, 2, 3, 10, 2, 2, 3, 7, 6, 2, 2, 5, 2, 5, 3, 21, 2, 2, 7, 5, 15, 2, 3, 13, 2, 3, 2, 13, 3, 2, 7, 5, 2, 3, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
REFERENCES
|
D. Cohen, R. W. K. Odoni, and W. W. Stothers, On the Least Primitive Root Modulo p^2, Bulletin of the London Mathematical Society 6:1 (March 1974), pp. 42-46.
|
|
LINKS
|
|
|
FORMULA
|
Cohen, Odoni, & Stothers prove that a(n) < prime(n)^(1/4 + e) for any e > 0 and all large enough n. Kerr, McGown, & Trudgian give an effective version: a(n) < prime(n)^0.99 for all n. - Charles R Greathouse IV, Apr 28 2020
|
|
MATHEMATICA
|
<< NumberTheory`NumberTheoryFunctions` Table[PrimitiveRoot[(Prime[n])^2], {n, 1, 100}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|