|
Search: id:A002958
|
|
|
| A002958 |
|
Numbers n such that 2*25^n - 1 is prime.
(Formerly M0870)
|
|
+0
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
C. R. Zarnke and H. C. Williams, Computer determination of some large primes, pp. 563-570 in Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computer Science. Vol. 2, edited R. C. Mullin et al., 1971.
|
|
MATHEMATICA
|
Do[m = n; If[PrimeQ[2*25^n - 1], Print[n]], {n, 1, 10^3}]
|
|
CROSSREFS
|
Sequence in context: A042583 A128839 A164817 this_sequence A115449 A079980 A025080
Adjacent sequences: A002955 A002956 A002957 this_sequence A002959 A002960 A002961
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
EXTENSIONS
|
666 from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 02 2000
|
|
|
Search completed in 0.002 seconds
|
