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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096548 Difference between the smallest 10^n-digit prime and 10^(10^n-1). 1
7, 289, 7, 33603, 309403, 593499 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Daniel Heuer found a(5) in 2004 by sieving up to 2^33 and then checking ~8000 candidates with pfgw-linux. Proving primality of 10^99999+309403 is beyond current (2004) technology.

a(6) was found by Kenneth Pedersen, Peter Kaiser, and Patrick De Geest. - Charles R Greathouse IV, Feb 11 2013

LINKS

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

Prime Curios, 10000...33603 (10000-digits).

Chris K. Caldwell, The largest known primes.

Daniel Heuer, Smallest 100000-digit prime? Discussion in the PrimeForm user group.

Henri Lifchitz, Renaud Lifchitz, Probable Primes Top 10000.

EXAMPLE

a(1)=7 because the smallest ten-digit prime is 1000000007.

a(2)=289 because the smallest 100-digit prime is 10^99+289.

CROSSREFS

Cf. A033873.

Sequence in context: A009503 A209889 A176072 * A160072 A137435 A220241

Adjacent sequences:  A096545 A096546 A096547 * A096549 A096550 A096551

KEYWORD

hard,nonn,base

AUTHOR

Hugo Pfoertner, Jul 06 2004

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 26 05:09 EDT 2017. Contains 292502 sequences.