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 A136364 #15 Aug 05 2024 04:37:47
%S A136364 8,283,5070,73669,966751,11970035,142725365,1657511569,18877697635,
%T A136364 211802823221,2348286736298,25785452449087,280880375389758,
%U A136364 3039062263181055,32693207724724247,349957928177109417,3729837791070240369,39600963003695964401,419035480966899467509
%N A136364 a(n) = Sum_{ composite k, 1 <= k <= 10^n} (Number of divisors d of k with 1 < d < k).
%H A136364 Amiram Eldar, <a href="/A136364/b136364.txt">Table of n, a(n) for n = 1..36</a> (calculated using the b-file at A057494)
%F A136364 a(n) = A057494(n) - 2*10^n + 1. - _Max Alekseyev_, May 10 2009
%e A136364 a(1) = 8 because there are 8 distinct divisors of composite numbers k through 10^1; these are for 4(1); 6(2); 8(2); 9(1); 10(2); and 1 + 2 + 2 + 1 + 2 = 8.
%Y A136364 Cf. A057494, A136363.
%K A136364 nonn
%O A136364 1,1
%A A136364 _Enoch Haga_, Dec 26 2007, Dec 29 2007
%E A136364 Edited by _N. J. A. Sloane_, Jan 12 2008
%E A136364 Three more terms from _Max Alekseyev_, May 10 2009
%E A136364 a(10)-a(16) from _Max Alekseyev_, Jan 25 2010
%E A136364 a(17)-a(19) from _Amiram Eldar_, Aug 05 2024