reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
Cf. A024779, A024781, A024782, A024783, A024784, A024785.
(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
_David W. Wilson (davidwwilson(AT)comcast.net)_
nonn,base,fini,full,new
David W. Wilson (davidwwilson(AT)attbicomcast.comnet)
nonn,base,fini,full,new
dww
David W. Wilson (davidwwilson(AT)attbi.com)
nonn,base,fini,full,new
wilson@ctron.com
dww
Every suffix prime and no 0 digits in base 5 (written in base 5).
2, 3, 12, 23, 32, 43, 232, 243, 412, 423, 2232, 4412, 4423, 22232, 222232
1,1
nonn,base,fini,full
wilson@ctron.com
approved