%I #10 Apr 27 2022 13:41:27
%S 2,3,13,23,113,223,323,1223,2113,3323,21223,32113,33323,233323,321223,
%T 333323
%N Every suffix is prime and contains no 0 digits in base 4 (written in base 4).
%o (Python)
%o from sympy import isprime
%o def afull():
%o prime_strings, alst = list("23"), []
%o while len(prime_strings) > 0:
%o alst.extend(sorted(int(p) for p in prime_strings))
%o candidates = set(d+p for p in prime_strings for d in "123")
%o prime_strings = [c for c in candidates if isprime(int(c, 4))]
%o return alst
%o print(afull()) # _Michael S. Branicky_, Apr 27 2022
%Y Cf. A024780, A024781, A024782, A024783, A024784, A024785.
%K nonn,base,fini,full
%O 1,1
%A _David W. Wilson_