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 A130901 #23 May 12 2024 02:05:32
%S A130901 1,26,281,2827,28288,282895,2828967,28289681,282896824,2828968252,
%T A130901 28289682538,282896825395,2828968253967,28289682539681,
%U A130901 282896825396824,2828968253968252,28289682539682538,282896825396825395,2828968253968253967,28289682539682539681
%N A130901 a(n) = Sum_{k=1..9} floor(10^n / k).
%H A130901 Reinhard Zumkeller, <a href="/A130901/b130901.txt">Table of n, a(n) for n = 0..100</a>
%H A130901 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (11,-10,-1,11,-10).
%F A130901 A055642(a(n)) = n.
%F A130901 From _Chai Wah Wu_, Jan 14 2021: (Start)
%F A130901 a(n) = 11*a(n-1) - 10*a(n-2) - a(n-3) + 11*a(n-4) - 10*a(n-5) for n > 7.
%F A130901 G.f.: (-5*x^7 - 2*x^6 + 2*x^5 + 16*x^4 - 3*x^3 + 5*x^2 + 15*x + 1)/((x - 1)*(x + 1)*(10*x - 1)*(x^2 - x + 1)). (End)
%e A130901 a(1) = [10/1]+[10/2]+[10/3]+[10/4]+[10/5]+[10/6]+[10/7]+[10/8]+[10/9] = 10 + 5 + 3 + 2 + 2 + 1 + 1 + 1 + 1 = 26;
%e A130901 a(2) = [100/1]+[100/2]+[100/3]+[100/4]+[100/5]+[100/6]+[100/7]+[100/8]+[100/9] = 100 + 50 + 33 + 25 + 20 + 16 + 14 + 12 + 11 = 281.
%t A130901 LinearRecurrence[{11,-10,-1,11,-10},{1,26,281,2827,28288,282895,2828967,28289681},20] (* _Harvey P. Dale_, May 12 2024 *)
%o A130901 (Python)
%o A130901 def a(n): return sum(10**n//k for k in range(1, 10))
%o A130901 print([a(n) for n in range(20)]) # _Michael S. Branicky_, Jan 26 2021
%o A130901 (PARI) a(n) = sum(k=1, 9, 10^n\k); \\ _Michel Marcus_, Jan 26 2021
%Y A130901 Cf. A055642, A130890.
%K A130901 nonn,easy
%O A130901 0,2
%A A130901 _Reinhard Zumkeller_, Jun 08 2007