OFFSET
1,1
COMMENTS
a(n) exists by Dirichlet's theorem.
LINKS
MAPLE
N:= 100: # for a(1) to a(N)
V:= Vector(N):
count:= 0:
for n from 1 while count < N do
if igcd(n, 10)=1 then
count:= count+1;
d:= ilog10(n)+1;
for x from n by 10^d do
if isprime(x) then V[count]:= x; break fi
od
fi
od:
convert(V, list); # Robert Israel, Nov 11 2020
PROG
(Python)
from sympy import isprime
def a(n):
ending = 2*n - 1 + (n+1)//4 * 2 # A045572
i, pow10 = ending, 10**len(str(ending))
while not isprime(i): i += pow10
return i
print([a(n) for n in range(1, 64)]) # Michael S. Branicky, Nov 03 2021
CROSSREFS
KEYWORD
AUTHOR
N. J. A. Sloane, Nov 11 2020.
EXTENSIONS
More terms from Robert Israel, Nov 11 2020
STATUS
approved