decompwlj 3D

Crystal ball sequence for planar net 3.6.3.6

A008580 on the OEIS · family polynomial

Weight–level plate of Crystal ball sequence for planar net 3.6.3.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 viewerA008580 on the OEIS
Terms100,000 (n = 0 … 99,999)
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 = 16,062
Forced level, l ≤ d²99,996
Range of a(n)1 … 22,499,750,001
Range of the jump d4 … 499,998
Largest weight k, level L22,495,350,233, 55,903

90,000 different gaps occur, from 4 to 499,998; every decomposable term is forced level (l <= d^2).

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.