Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001773
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001773 Numbers n such that 13*2^n-1 is prime.
(Formerly M2686 N1076)
+0
1
3, 7, 23, 287, 291, 795, 2203, 5711, 7927, 9443, 10095, 19071, 29611, 34651, 51875, 55343, 77511, 166303, 233207 (list; graph; listen)
OFFSET

1,1

REFERENCES

H. Riesel, ``Prime numbers and computer methods for factorization,'' Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see pp. 381-384.

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).

H. C. Williams and C. R. Zarnke, Math. Comp., 22 (1968), 420-422.

LINKS

Ray Ballinger and Wilfrid Keller, List of primes k.2^n + 1 for k < 300

Wilfrid Keller, List of primes k.2^n - 1 for k < 300

Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime

CROSSREFS

Cf. A032356, 13*2^n+1 is prime.

Sequence in context: A121883 A060235 A090188 this_sequence A067604 A090118 A099183

Adjacent sequences: A001770 A001771 A001772 this_sequence A001774 A001775 A001776

KEYWORD

hard,nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), Jun 23 2004

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research