A168010 a(n) = Sum of all numbers of divisors of all numbers k such that n^2 <= k < (n+1)^2.

5, 15, 25, 39, 47, 67, 75, 95, 105, 129, 129, 163, 167, 191, 205, 229, 231, 269, 267, 299, 313, 337, 341, 379, 387, 409, 427, 459, 445, 505, 497, 529, 553, 573, 571, 627, 625, 657, 661, 711, 687, 757, 743, 783, 805, 821, 831, 885, 875, 913, 929, 961, 961, 1011

Offset

1,1

Comments

A straightforward approach to calculate a(n) would require computing tau (A000005) for the 2n+1 integers between n^2 and (n+1)^2. Since Sum_{i=1..n} tau(i) can be computed by summing sqrt(n) terms, we can compute a(n) via the summation of n terms of the form 2*(floor(n*(n+2)/i)-floor((n-1)*(n+1)/i)) without the need to compute tau. Similarly for the sequence A168012. - Chai Wah Wu, Oct 24 2023

Links

Chai Wah Wu, Table of n, a(n) for n = 1..10000 (n = 1..1000 from G. C. Greubel)

Example

a(2) = 15 because the numbers k are 4, 5, 6, 7 and 8 (since 2^2 <= k < 3^2) and d(4) + d(5) + d(6) + d(7) + d(8) = 3 + 2 + 4 + 2 + 4 = 15, where d(n) is the number of divisors of n (see A000005).

Mathematica

Table[Total[DivisorSigma[0, Range[n^2, (n+1)^2-1]]], {n, 60}] (* Harvey P. Dale, Aug 17 2015 *)

Prog

(PARI) a(n)=sum(k=n^2, (n+1)^2-1, numdiv(k)) \\ Franklin T. Adams-Watters, May 14 2010
(Python)
def A168010(n):
    a, b = n*(n+2), (n-1)*(n+1)
    return (sum(a//k-b//k for k in range(1, n))<<1)+5 # Chai Wah Wu, Oct 23 2023

Crossrefs

Cf. A000005, A168011, A168012, A168013.

Sequence in context: A017329 A068528 A061443 * A353613 A229312 A197072

Adjacent sequences: A168007 A168008 A168009 * A168011 A168012 A168013

Keyword

nonn

Author

Omar E. Pol, Nov 16 2009

Extensions

More terms from Franklin T. Adams-Watters, May 14 2010

Status

approved