%I A136364
%S A136364 8,283,5070,73669,966751,11970035,142725365,1657511569,18877697635
%N A136364 a(n) = Sum_{ composite k, 1 <= k <= 10^n} (Number of divisors d of k 
               with 1 < d < k).
%F A136364 a(n) = A057494(n) - 2*10^n + 1 [From Max Alekseyev (maxale(AT)gmail.com), 
               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. A136363.
%Y A136364 Sequence in context: A159496 A045479 A079929 this_sequence A089670 A060355 
               A060859
%Y A136364 Adjacent sequences: A136361 A136362 A136363 this_sequence A136365 A136366 
               A136367
%K A136364 easy,more,nonn
%O A136364 1,1
%A A136364 Enoch Haga (Enokh(AT)comcast.net), Dec 26 2007, Dec 29 2007
%E A136364 Edited by N. J. A. Sloane (njas(AT)research.att.com), Jan 12 2008
%E A136364 Three more terms from Max Alekseyev (maxale(AT)gmail.com), May 10 2009