decompwlj 3D

Weight × level + jump, eight hundred sequences

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 above d, the level L = (a − d)/k. 10⁵ terms per sequence. Open a plate to explore it in three dimensions; the A-number under it opens the sequence on the OEIS.

Each plate is the weight–level plane on a square with equal aspect: log k / log A across, log L / log A up, A the largest term shown. Every sequence then shares one frame. Points lie below the dotted edge kL = A, and level-classified terms (k > L) fall below the dashed diagonal k = L. Blue is weight (k ≤ L, ties included), orange is level.

loading…