OFFSET
0,2
COMMENTS
The Polymath project describes an algorithm for computing a(n) in time O(2.154...^n), see Tao, Croot, and Helfgott link. - Charles R Greathouse IV, Apr 16 2012
LINKS
Henri Lifchitz, Table of n, a(n) for n = 0..36
Terence Tao, Ernest Croot III, and Harald Helfgott, Deterministic methods to find primes, Mathematics of Computation, 81 (2012), 1233-1246. arXiv:1009.3956, [math.NT], 2010-2012.
FORMULA
a(n) = A006218(10^n). - Max Alekseyev, May 10 2009
MATHEMATICA
k = s = 0; Do[ While[ k < 10^n, k++; s = s + DivisorSigma[ 0, k ] ]; Print[s], {n, 0, 8} ]
PROG
(PARI) a(n) = sum(k=1, 10^n, numdiv(k)); \\ Michel Marcus, Feb 19 2017
(Python)
from math import isqrt
def A057494(n): return -(s:=isqrt(m:=10**n))**2+(sum(m//k for k in range(1, s+1))<<1) # Chai Wah Wu, Oct 23 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Sep 21 2000
EXTENSIONS
a(10)-a(16) from Max Alekseyev, Jan 25 2010
a(17)-a(19) from Donovan Johnson, Dec 26 2012
a(20)-a(27) from Hiroaki Yamanouchi, Sep 22 2015
a(28)-a(36) from Henri Lifchitz, Feb 19 2017
STATUS
approved