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 A353181 #25 Jun 25 2022 22:10:47 %S A353181 1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99,100,101,110,111,112,113, %T A353181 114,115,116,117,118,119,121,122,131,133,141,144,151,155,161,166,171, %U A353181 177,181,188,191,199,200,202,211,212,220,221,222,223,224,225,226,227,228,229,232 %N A353181 Numbers in which more than half of the digits are the same. %C A353181 Same as A044959 for terms <= 1000, and then differing at A044959(272) = 1001 which is not a term here (the next instead a(272) = 1011). %H A353181 Zhining Yang, <a href="/A353181/b353181.txt">Table of n, a(n) for n = 1..30000</a> %e A353181 1211 is a term: it has 4 digits, 3 of which are 1's, and 3/4 > 1/2. %e A353181 1212 is not a term: it has 4 digits, no one of which appears more than twice. %t A353181 Select[Range[300], Max[DigitCount[#]] > IntegerLength[#]/2 &] %o A353181 (Python) %o A353181 def ok(k): %o A353181 t=str(k) %o A353181 return(max(t.count(str(i)) for i in range(10))>(len(t)//2)) %o A353181 print([n for n in range(1, 201) if ok(n)]) %Y A353181 Cf. A109303, A044959. %K A353181 nonn,base,easy %O A353181 1,2 %A A353181 _Zhining Yang_, Apr 29 2022