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