reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
(Python)
from sympy import isprime, nextprime
def alst(nn):
alst, astr = [2], "2"
for n in range(2, nn+1):
p = nextprime(10**(n-1))
while not isprime(int(astr + str(p))): p = nextprime(p)
alst.append(int(astr + str(p))); astr += str(p)
return alst
print(alst(11)) # Michael S. Branicky, Dec 26 2020
proposed
editing
editing
proposed
Name changed corrected by Michael S. Branicky, Dec 26 2020
Smallest a(n) is the smallest Xmas tree prime that has with a(n-1) as a prefix (starting with 2).
Name changed by Michael S. Branicky, Dec 26 2020
proposed
editing
editing
proposed
Smallest Xmas tree prime that has a(n-1) as a prefix (starting with k digits where k is the n-th triangular number2).
approved
editing
reviewed
approved