decompwlj 3D

Sorting numbers: number of comparisons for merge insertion sort of n elements

A001768 on the OEIS · family summatory

Weight–level plate of Sorting numbers: number of comparisons for merge insertion sort of n elements
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 viewerA001768 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,997
Level class, k > L28,280 · 28.28 %
Weight class, k ≤ L71,717 · 71.72 %
Ties, k = L13
On the level line L = 17,117
Forced level, l ≤ d²3
Range of a(n)0 … 1,525,247
Range of the jump d1 … 17
Largest weight k, level L1,524,839, 84,735

17 different gaps occur, from 1 to 17; the level share is 28.28 %.

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.