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 A110775 #18 Nov 19 2024 20:16:12 %S A110775 2,1,2,2,7,10,101,196,9,550,6150,4532,3249,12360,8719 %N A110775 Number of digits in A110774(n). %o A110775 (Python) %o A110775 from sympy import isprime %o A110775 from itertools import count, islice %o A110775 def agen(): # generator of terms %o A110775 s = "" %o A110775 while True: %o A110775 for d in "13": %o A110775 for k in count(1): %o A110775 if isprime(int(s+d*k)): break %o A110775 yield k %o A110775 s += d*k %o A110775 print(list(islice(agen(), 10))) # _Michael S. Branicky_, Aug 23 2022 %Y A110775 Cf. A110774, A110776, A110777, A110778, A112534, A110780, A110781, A110782, A110783, A110788, A110789 %K A110775 base,nonn,more %O A110775 1,1 %A A110775 _Amarnath Murthy_, Aug 12 2005 %E A110775 Corrected and extended by _Joshua Zucker_, Jan 11 2006 %E A110775 a(11) from _Michael S. Branicky_, Aug 23 2022 %E A110775 a(12)-a(13) from _Michael S. Branicky_, May 29 2023 %E A110775 a(14)-a(15) from _Michael S. Branicky_, Nov 19 2024