|
%I M5348 N2325 #30 May 08 2018 15:11:53
%S 71,239,241,359,431,499,599,601,919,997,1051,1181,1249,1439,1609,1753,
%T 2039,2089,2111,2179,2251,2281,2341,2591,2593,2671,2711,2879,3119,
%U 3121,3169,3181,3457,3511,3541,3719,3739,3769,4271,4513,4799,4801,4943,5197
%N Primes with 7 as smallest primitive root.
%D 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.
%D M. Kraitchik, Recherches sur la Théorie des Nombres. Gauthiers-Villars, Paris, Vol. 1, 1924, Vol. 2, 1929, see Vol. 1, p. 58.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A001126/b001126.txt">Table of n, a(n) for n = 1..1000</a>
%H M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%H <a href="/index/Pri#primes_root">Index entries for primes by primitive root</a>
%t Prime[ Select[ Range[1000], PrimitiveRoot[ Prime[ # ] ] == 7 & ] ]
%t Select[ Prime@Range@700, PrimitiveRoot@# == 7 &] (* _Robert G. Wilson v_, May 11 2001 *)
%o (PARI) is(n)=n>9&&isprime(n)&&znorder(Mod(7,n))+1==n \\ _Charles R Greathouse IV_, Mar 20 2013
%K nonn
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Robert G. Wilson v_, May 10 2001
|
