|
Search: id:A002255
|
|
|
| A002255 |
|
Numbers n such that 7.4^n + 1 is prime.
(Formerly M0826 N0315)
|
|
+0
2
|
|
| 1, 2, 3, 7, 10, 13, 25, 26, 46, 60, 87, 90, 95, 145, 160, 195, 216, 308, 415, 902, 1128, 3307, 6748, 7747, 8348, 11193, 27243
(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
C. K. Caldwell, The Prime Pages
Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime
|
|
CROSSREFS
|
See A032353 (which is the main entry for this sequence) for more terms.
Sequence in context: A140512 A101956 A002238 this_sequence A088163 A048448 A054060
Adjacent sequences: A002252 A002253 A002254 this_sequence A002256 A002257 A002258
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
