This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A024780 #10 Apr 27 2022 15:01:53 %S A024780 2,3,12,23,32,43,232,243,412,423,2232,4412,4423,22232,222232 %N A024780 Every suffix prime and no 0 digits in base 5 (written in base 5). %o A024780 (Python) %o A024780 from sympy import isprime %o A024780 def afull(): %o A024780 prime_strings, alst = list("23"), [] %o A024780 while len(prime_strings) > 0: %o A024780 alst.extend(sorted(int(p) for p in prime_strings)) %o A024780 candidates = set(d+p for p in prime_strings for d in "1234") %o A024780 prime_strings = [c for c in candidates if isprime(int(c, 5))] %o A024780 return alst %o A024780 print(afull()) # _Michael S. Branicky_, Apr 27 2022 %Y A024780 Cf. A024779, A024781, A024782, A024783, A024784, A024785. %K A024780 nonn,base,fini,full %O A024780 1,1 %A A024780 _David W. Wilson_