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 A134777 #8 Dec 12 2023 16:30:11 %S A134777 0,1,2,3,4,5,6,7,8,9,1,1,1,1,4,5,1,1,8,9,2,1,2,3,4,5,6,7,8,9,3,1,3,3, %T A134777 4,5,6,7,8,9,4,4,4,4,4,5,4,4,8,4,5,5,5,5,5,5,5,5,8,5,6,1,6,6,4,5,6,7, %U A134777 8,9,7,1,7,7,4,5,7,7,8,9,8,8,8,8,8,8,8,8,8,8,9,9,9,9,4,5,9,9,8,9,1,1,1,1,4 %N A134777 First digit of n alphabetically. %C A134777 Digits are decimal with names in English (see A000052). A134777(n)=A134778(n) iff n is a repdigit (n=A010785(m)), in which case a(n)=A010888(m), the repeated digit. a(n)=0 only for n=0. a(n)=8 iff n is a member of A011538. %H A134777 Michael S. Branicky, <a href="/A134777/b134777.txt">Table of n, a(n) for n = 0..10000</a> %e A134777 a(104) = 4 because the digits of 104 are 1 (one), 0 (zero) and 4 (four) and "four" occurs before both "one" and "zero" alphabetically. %o A134777 (Python) %o A134777 def alpha(n): return [8, 5, 4, 9, 1, 7, 6, 3, 2, 0].index(n) %o A134777 def a(n): return sorted(map(int, str(n)), key=alpha)[0] %o A134777 print([a(n) for n in range(105)]) # _Michael S. Branicky_, Dec 12 2023 %Y A134777 Cf. A134778, A000052, A010785, A010888, A011538. %K A134777 base,easy,nonn,word %O A134777 0,3 %A A134777 _Rick L. Shepherd_, Nov 11 2007