login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064721 Potential Sierpiński numbers: integers for which the smallest m > 2^10 in A040076 such that n*2^m+1 is prime (A050921). 1
383, 766, 881, 1532, 1643, 1762, 2897, 3061, 3064, 3286, 3443, 3524, 3829, 4847, 4861, 5297, 5359, 5794, 5897, 6122, 6128, 6319, 6572, 6886, 7013, 7352, 7493, 7651, 7658, 7909, 7957, 8119, 8269, 8423, 8543, 8929, 9323, 9694, 9722 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The first confirmed Sierpiński number is 78557.

LINKS

Table of n, a(n) for n=1..39.

MATHEMATICA

Do[m = 0; While[m <= 2^10 && !PrimeQ[n*2^m + 1], m++ ]; If[m > 2^10, Print[n]], {n, 1, 10^4} ]

CROSSREFS

Cf. A040076, A050921.

Sequence in context: A015861 A072385 A045122 * A252060 A046014 A046491

Adjacent sequences:  A064718 A064719 A064720 * A064722 A064723 A064724

KEYWORD

nonn

AUTHOR

Robert G. Wilson v, Oct 16 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 00:49 EDT 2020. Contains 337227 sequences. (Running on oeis4.)