OFFSET
1,1
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 864.
M. Kraitchik, Recherches sur la Théorie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 57.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
MATHEMATICA
<< NumberTheory`NumberTheoryFunctions`; Prime[ Select[ Range[200], PrimitiveRoot[ Prime[ # ] ] == 5 & ] ]
(* first load *) << NumberTheory`NumberTheoryFunctions` (* then *) Select[ Prime@Range@300, PrimitiveRoot@# == 5 &] (* Robert G. Wilson v, May 11 2001 *)
Select[Prime[Range[350]], PrimitiveRoot[#]==5&] (* The PrimitiveRoot function is now part of Mathematica's core, so no add-in needs to be loaded before calling it *) (* Harvey P. Dale, Dec 06 2014 *)
PROG
(Python)
from itertools import islice
from sympy import nextprime, primitive_root
def A001124_gen(): # generator of terms
p = 5
while (p:=nextprime(p)):
if primitive_root(p)==5:
yield p
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
More terms from Robert G. Wilson v, May 10 2001
STATUS
approved