decompwlj 3D

a(n) = Sum_{k=1..n} k*floor(n/k); also Sum_{k=1..n} sigma(k) where sigma(n) = sum of divisors of n (A000203)

A024916 on the OEIS · family summatory · also known as Sum of sigma(k) for k <= n

Weight–level plate of a(n) = Sum_{k=1..n} k*floor(n/k); also Sum_{k=1..n} sigma(k) where sigma(n) = sum of divisors of n (A000203)
Click the plate to explore it in 3-D. Weight k across, level L up, both on log scales: blue in the weight class (k ≤ L), orange in the level class (k > L). The dashed diagonal is k = L.
Open in the 3-D viewerA024916 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,996
Level class, k > L99,996 · 100.00 %
Weight class, k ≤ L0 · 0.00 %
Ties, k = L0
On the level line L = 15,395
Forced level, l ≤ d²99,996
Range of a(n)1 … 8,224,740,835
Range of the jump d3 … 403,200
Largest weight k, level L8,224,248,679, 81,457

Sum of sigma(k) for k <= n: a ~ pi^2 n^2/12 = 0.822 n^2 and d = sigma(n+1) > n: every decomposable term is forced level (100 %).

The decomposition

Every term of a strictly increasing sequence is written a(n) = k(n)·L(n) + d(n): the jump d = a(n+1) − a(n), the weight k the least divisor of a − d greater than d, the level L = (a − d)/k. A term decomposes when a > 2d; it is in the level class when k > L and in the weight class when k ≤ L. See decompwlj.com and arXiv:0711.0865, or how it works, with worked examples and a live one.