decompwlj 3D

a(n) = C(n+2,3) + C(n,3) + C(n-1,3)

A006004 on the OEIS · family polynomial

Weight–level plate of a(n) = C(n+2,3) + C(n,3) + C(n-1,3)
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 viewerA006004 on the OEIS
Terms100,000 (n = 1 … 100,000)
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 = 17,440
Forced level, l ≤ d²99,993
Range of a(n)1 … 499,990,000,249,999
Range of the jump d3 … 14,999,950,002
Largest weight k, level L499,615,098,691,573, 33,183

Every gap is different, from 3 to 14,999,950,002; every decomposable term is forced level (l <= d^2); 7 terms do not decompose.

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.