|
|
A110065
|
|
Numbers k such that 10^k - k is prime.
|
|
9
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
For each n, a(n) == 3 (mod 6) or a(n) == 5 (mod 6).
|
|
LINKS
|
|
|
PROG
|
(Python)
from sympy import isprime
def afind(limit):
m, pow10 = 0, 1
while m <= limit:
if isprime(pow10 - m): print(m, end=", ")
m, pow10 = m + 1, pow10 * 10
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|