|
| |
|
|
A053976
|
|
Least number such that a(n) and nextprime(a(n)) differ by at least a power of 10, 10^m, where m >= n.
|
|
2
|
| |
|
|
|
OFFSET
|
0,1
|
|
|
COMMENTS
|
a(4) <= 7910896513*A034386(283)/30 - 6480, a(5) <= 64279*A034386(3371)/5610 - 71678, a(6) <= 587*A034386(43103)/2310 - 455704 (using data from Nicely). - Chai Wah Wu, Jun 26 2019
|
|
|
LINKS
|
Table of n, a(n) for n=0..3.
Thomas R. Nicely, Some Results of Computational Research in Prime Numbers [Local copy, pdf only] [ See local copy in A007053]
|
|
|
EXAMPLE
|
The primes following those shown are 3, 127, 370373, 1693182318747503. - Michel Marcus, Jan 29 2016
|
|
|
PROG
|
(PARI) a(n) = {my(p = 2); while (nextprime(p+1) - p < 10^n, p = nextprime(p+1)); p; } \\ Michel Marcus, Jan 29 2016
|
|
|
CROSSREFS
|
Cf. A002386, A034386.
Sequence in context: A142112 A285145 A278925 * A217088 A034312 A224871
Adjacent sequences: A053973 A053974 A053975 * A053977 A053978 A053979
|
|
|
KEYWORD
|
nonn,hard,more
|
|
|
AUTHOR
|
Jeff Burch, Apr 02 2000
|
|
|
EXTENSIONS
|
Definition clarified by Michel Marcus, Jan 29 2016
Definition clarified by Chai Wah Wu, Jun 26 2019
|
|
|
STATUS
|
approved
|
| |
|
|
