OFFSET
1,1
COMMENTS
Smallest prime number that remains prime when removing k times (1 <= k <= n) the one or two central digits, depending on whether the prime number has an odd or even number of digits.
LINKS
Jason Yuen, Table of n, a(n) for n = 1..89
Jason Yuen, Python program.
EXAMPLE
a(2) = 10009. This is because 10009, 1009, and 19 are all prime numbers, and there is no smaller prime number that satisfies this property.
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Jean-Marc Rebert, Mar 27 2024
EXTENSIONS
More terms from Jason Yuen, Apr 03 2024
STATUS
approved