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 A178787 #11 Feb 16 2025 08:33:12 %S A178787 1,2,3,4,5,6,7,8,9,10,11,11,12,13,14,15,16,17,18,19,20,21,21,22,23,24, %T A178787 25,26,27,28,29,30,31,31,32,33,34,35,36,37,38,39,40,41,41,42,43,44,45, %U A178787 46,47,48,49,50,51,51,52,53,54,55,56,57,58,59,60,61,61,62,63,64,65,66 %N A178787 Number of numbers <= n having distinct digits in their decimal representation, cf. A010784. %C A178787 a(m)<=a(n) for m<n and a(n)=8877690 for n>=9876543210; %C A178787 a(A010784(n)) = n; a(A109303(n)) = a(A109303(n)-1); %C A178787 partial sums of A178788. %H A178787 R. Zumkeller, <a href="/A178787/b178787.txt">Table of n, a(n) for n = 0..25000</a> %H A178787 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Digit.html">Digit</a> %e A178787 a(12) = #{0,1,2,3,4,5,6,7,8,9,10,12} = 12; %e A178787 a(24) = a(12) + #{13,14,15,16,17,18,19,20,21,23,24} = 23. %t A178787 f[n_] := Length[ Select[ Range[0, n], Max[ DigitCount[#]] == 1 &]]; Array[f, 70, 0] (* _Robert G. Wilson v_, Dec 13 2016 after _Harvey P. Dale_ in A010784 *) %o A178787 (Haskell) %o A178787 a178787 n = a178787_list !! n %o A178787 a178787_list = scanl1 (+) a178788_list %o A178787 -- _Reinhard Zumkeller_, Mar 15 2014 %K A178787 base,nonn %O A178787 0,2 %A A178787 _Reinhard Zumkeller_, Jun 30 2010