

A096548


Difference between the smallest 10^ndigit prime and 10^(10^n1).


1




OFFSET

1,1


COMMENTS

Daniel Heuer found a(5) in 2004 by sieving up to 2^33 and then checking ~8000 candidates with pfgwlinux. 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 (10000digits).
Chris K. Caldwell, The largest known primes.
Daniel Heuer, Smallest 100000digit prime? Discussion in the PrimeForm user group.
Henri Lifchitz, Renaud Lifchitz, Probable Primes Top 10000.


EXAMPLE

a(1)=7 because the smallest tendigit prime is 1000000007.
a(2)=289 because the smallest 100digit 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



