Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002257
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002257 Numbers n such that 13.4^n + 1 is prime.
(Formerly M3247 N1310)
+0
2
1, 4, 5, 10, 14, 41, 94, 154, 158, 500 (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.

LINKS

Ray Ballinger, Proth Search Page

CROSSREFS

See A032356 for more terms.

Sequence in context: A114517 A116930 A073119 this_sequence A101528 A119040 A135104

Adjacent sequences: A002254 A002255 A002256 this_sequence A002258 A002259 A002260

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research