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