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 A373064 #11 May 25 2024 15:32:47 %S A373064 0,1,2,3,4,5,6,7,8,9,1,1,2,3,4,5,6,7,8,9,2,2,2,3,4,5,6,7,8,9,3,3,3,3, %T A373064 4,5,6,7,8,9,4,4,4,4,4,5,6,7,8,9,5,5,5,5,5,5,6,7,8,9,6,6,6,6,6,6,6,7, %U A373064 8,9,7,7,7,7,7,7,7,7,8,9,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,0,1,2,3,4 %N A373064 The mode of the digits of n (using largest mode if multimodal). %C A373064 First differs from A054055 at n = 100. %H A373064 Paolo Xausa, <a href="/A373064/b373064.txt">Table of n, a(n) for n = 0..10000</a> %e A373064 a(100) = 0 because 0 is the digit occurring with the highest frequency in 100. %e A373064 a(123300) = 3 because both 0 and 3 occur with the (same) highest frequency in 123300, and 3 is the largest digit. %t A373064 Array[Max[Commonest[IntegerDigits[#]]] &, 120, 0] %o A373064 (Python) %o A373064 from statistics import multimode %o A373064 def a(n): return int(max(multimode(str(n)))) %o A373064 print([a(n) for n in range(105)]) # _Michael S. Branicky_, May 21 2024 %Y A373064 Cf. A054055, A115353. %K A373064 nonn,base,easy %O A373064 0,3 %A A373064 _Paolo Xausa_, May 21 2024