|
Search: id:A002263
|
|
|
| A002263 |
|
Numbers n such that 25.4^n + 1 is prime.
(Formerly M0721 N0269)
|
|
+0
1
|
|
| 1, 2, 3, 5, 10, 11, 26, 32, 39, 92, 116, 134, 170, 224, 277, 332, 370, 374, 640, 664, 820, 1657, 1952, 1969
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
H. Riesel, ``Prime numbers and computer methods for factorization,'' Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see pp. 381-384.
R. M. Robinson, A report on primes of the form k.2^n+1 and on factors of Fermat numbers, Proc. Amer. Math. Soc., 9 (1958), 673-681.
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
|
Ray Ballinger, Proth Search Page
|
|
CROSSREFS
|
For more terms see A032362.
Sequence in context: A076681 A047604 A104427 this_sequence A039022 A079251 A050051
Adjacent sequences: A002260 A002261 A002262 this_sequence A002264 A002265 A002266
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
