decompwlj 3D

Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6

A000292 on the OEIS · family polynomial · also known as Tetrahedral numbers

Weight–level plate of Tetrahedral (or triangular pyramidal) numbers: a(n) = C(n+2,3) = n*(n+1)*(n+2)/6
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 viewerA000292 on the OEIS
Terms100,000 (n = 0 … 99,999)
Decomposable (a > 2d)99,993
Level class, k > L99,993 · 100.00 %
Weight class, k ≤ L0 · 0.00 %
Ties, k = L0
On the level line L = 1329
Forced level, l ≤ d²99,993
Range of a(n)0 … 166,666,666,650,000
Range of the jump d1 … 5,000,050,000
Largest weight k, level L164,555,642,646,323, 33,180

d = (n + 1)(n + 2)/2 grows like n^2 while l grows like n^3/6, so l/d^2 -> 0: every decomposable term is forced level (100 %), and the line L = 1 is thin (329 terms).

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.