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 A336759 #12 Sep 14 2020 20:19:56 %S A336759 1,10,21,309,2108,21996,220884,2111105,21866660 %N A336759 a(n) is the smallest positive number that is the sum of no fewer than n distinct repdigits. %C A336759 Conjecture: the sequence is infinite. %e A336759 10 is the sum of 2 distinct repdigits: 9 + 1 %e A336759 21 is the sum of 3 distinct repdigits: 11 + 9 + 1 %e A336759 309 is the sum of 4 distinct repdigits: 222 + 77 + 9 + 1 %e A336759 2108 is the sum of 5 distinct repdigits: 1111 + 888 + 99 + 9 + 1 %e A336759 All numbers less than 10 can be summed with less than 2 distinct repdigits. %e A336759 All numbers less than 21 can be summed with less than 3 distinct repdigits. %Y A336759 Cf. A010785, A336748. %K A336759 nonn,base,more %O A336759 1,2 %A A336759 _Falcon Shapiro_, Aug 03 2020 %E A336759 a(7)-a(9) from _Sean A. Irvine_, Aug 29 2020