decompwlj 3D

Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere

A035008 on the OEIS · family polynomial

Weight–level plate of Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere
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 viewerA035008 on the OEIS
Terms100,000 (n = 0 … 99,999)
Decomposable (a > 2d)99,995
Level class, k > L99,995 · 100.00 %
Weight class, k ≤ L0 · 0.00 %
Ties, k = L0
On the level line L = 12
Forced level, l ≤ d²99,995
Range of a(n)0 … 79,999,200,000
Range of the jump d16 … 1,600,000
Largest weight k, level L4,998,750,077, 49,840

Every gap is different, from 16 to 1,600,000; 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.