LINKS
Hugo Pfoertner, <a href="/A065582/b065582_1.txt">Table of n, a(n) for n = 1..500</a> (first 100 terms from Harry J. Smith).
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hugo Pfoertner, <a href="/A065582/b065582_1.txt">Table of n, a(n) for n = 1..500</a> (first 100 terms from Harry J. Smith).
reviewed
approved
proposed
reviewed
editing
proposed
Hugo Pfoertner, <a href="/A065582/b065582_1.txt">Table of n, a(n) for n = 1..500</a>, (first 100 terms from Harry J. Smith).
proposed
editing
editing
proposed
(Python)
from sympy import isprime
def a(n):
pow, end, i = 10**n, 10**n-1, 1
while i%10 == 9 or not isprime(i*pow + end): i += 1
return i*pow + end
print([a(n) for n in range(1, 20)]) # Michael S. Branicky, Jul 30 2022
proposed
editing
editing
proposed
From Jeppe Stig Nielsen, Jul 30 2022: (Start)
Can decrease, for example a(25) < a(24). So not the same as Smallest prime ending in n or more 9s. - _Jeppe Stig Nielsen_, Jul 30 2022
a(n) can contain other 9s as well, for example a(46), a(118), a(156). - _Jeppe Stig Nielsen_, Jul 30 2022(End)
proposed
editing
editing
proposed