login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212290 Difference between the smallest 10^n-bit prime and 2^(10^n-1). 0
9, 255, 1239, 5895, 221961 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(5) found by Serge Batalov, Jun 11 2012.

LINKS

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

Henri Lifchitz, Renaud Lifchitz, Probable Primes Top 10000.

EXAMPLE

2^99+255 is the smallest 100-bit prime, 2^999+1239 is the smallest 1000-bit prime, etc.

PROG

(PARI) a(n)=nextprime(2^(10^n-1))-2^(10^n-1)

CROSSREFS

Binary analog of A096548.

Sequence in context: A256019 A135484 A178186 * A296950 A025133 A193129

Adjacent sequences:  A212287 A212288 A212289 * A212291 A212292 A212293

KEYWORD

nonn,hard

AUTHOR

Charles R Greathouse IV, Jun 16 2012

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 May 19 07:05 EDT 2019. Contains 323386 sequences. (Running on oeis4.)