|
Search: id:A136363
|
|
|
| A136363 |
|
a(n) = Sum_{ composite k, 1 <= k <= 10^n} (Sum of divisors d of k with 1 < d < k). |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(1)=23 because the divisors through 10^1 are as follows: 4 (2); 6 (2,3); 8 (2,4); 9 (3); 10 (2,5). The sum is 2+2+3+2+4+3+2+5=23.
|
|
CROSSREFS
|
Cf. A136364.
Adjacent sequences: A136360 A136361 A136362 this_sequence A136364 A136365 A136366
Sequence in context: A088385 A030461 A131353 this_sequence A134798 A103443 A059000
|
|
KEYWORD
|
easy,more,nonn
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), Dec 26 2007, Dec 29 2007
|
|
EXTENSIONS
|
Edited by njas, Jan 12 2008
|
|
|
Search completed in 0.002 seconds
|
