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 A382401 #22 Mar 24 2025 05:57:32 %S A382401 0,0,0,0,0,0,0,0,0,1,0,2,3,4,5,6,7,8,9,2,2,0,3,4,5,6,7,8,9,3,3,3,0,4, %T A382401 5,6,7,8,9,4,4,4,4,0,5,6,7,8,9,5,5,5,5,5,0,6,7,8,9,6,6,6,6,6,6,0,7,8, %U A382401 9,7,7,7,7,7,7,7,0,8,9,8,8,8,8,8,8,8,8,0,9,9,9,9,9,9,9,9,9,9,0,1,11,12,13,14,15,16,17,18,19,11,0,2,3,4,5,6,7,8,9,12 %N A382401 a(n) is the number formed by removing all copies of the smallest digit of n, or 0 if no digits remain. %C A382401 A variant of A382056. %C A382401 A larger than usual number of terms is provided in order to distinguish this sequence from A382371, from which it first differs at n = 112. %H A382401 Paolo Xausa, <a href="/A382401/b382401.txt">Table of n, a(n) for n = 1..10000</a> %e A382401 a(112) = 2 (the two digits 1 are removed). %e A382401 a(4535) = 455 (the digit 3 is removed). %t A382401 A382401[n_] := FromDigits[DeleteCases[#, Min[#]]] & [IntegerDigits[n]]; %t A382401 Array[A382401, 120] %o A382401 (Python) %o A382401 def a(n): %o A382401 s = str(n) %o A382401 m = min(s) %o A382401 r = s.replace(m, "") %o A382401 return int(r) if r != "" else 0 %o A382401 print([a(n) for n in range(1, 121)]) # _Michael S. Branicky_, Mar 23 2025 %o A382401 (PARI) a(n) = my(d=digits(n)); fromdigits(select(x->(x!=vecmin(d)), d)); \\ _Michel Marcus_, Mar 24 2025 %Y A382401 Cf. A054054, A382056, A382371. %K A382401 nonn,base,look %O A382401 1,12 %A A382401 _Paolo Xausa_, Mar 23 2025