|
|
A072692
|
|
Sum of sigma(j) for 1<=j<=10^n, where sigma(j) is the sum of the divisors of j.
|
|
9
|
|
|
1, 87, 8299, 823081, 82256014, 8224740835, 822468118437, 82246711794796, 8224670422194237, 822467034112360628, 82246703352400266400, 8224670334323560419029, 822467033425357340138978, 82246703342420509396897774, 8224670334241228180927002517
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
Asymptotic formula: a(n) ~ Pi^2/12 * 10^2n. See A072691 for Pi^2/12. Observe that A025281 also contains that constant in its asymptotic formula.
|
|
EXAMPLE
|
For n=1, the sum of sigma(j) for j<=10 is 1+3+4+7+6+12+8+15+13+18=87, so a(1)=87 (=69+18=A049000(1)+A046915(1)).
|
|
PROG
|
(PARI) for(m=0, 10, print1(sum(n=1, k=10^m, n*(k\n)), ", ")) \\ Improved by M. F. Hasler, Apr 18 2015
(Python) [(i, sum([d*(10**i//d) for d in range(1, 10**i+1)])) for i in range(8)] # Seth A. Troisi, Jun 27 2010
(Python)
from math import isqrt
def A072692(n): return -(s:=isqrt(m:=10**n))**2*(s+1)+sum((q:=m//k)*((k<<1)+q+1) for k in range(1, s+1))>>1 # Chai Wah Wu, Oct 23 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from P L Patodia (pannalal(AT)usa.net), Jan 11 2008, Jun 25 2008
|
|
STATUS
|
approved
|
|
|
|