OFFSET
1,1
PROG
(Python)
from sympy import isprime
def afull():
prime_strings, alst = list("23"), []
while len(prime_strings) > 0:
alst.extend(sorted(int(p) for p in prime_strings))
candidates = set(d+p for p in prime_strings for d in "1234")
prime_strings = [c for c in candidates if isprime(int(c, 5))]
return alst
print(afull()) # Michael S. Branicky, Apr 27 2022
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
STATUS
approved