decompwlj 3D

Smallest number of sticks of length 1 needed to construct n squares with sides of length 1

A078633 on the OEIS · family polynomial

Weight–level plate of Smallest number of sticks of length 1 needed to construct n squares with sides of length 1
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 viewerA078633 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,999
Level class, k > L13,764 · 13.76 %
Weight class, k ≤ L86,235 · 86.24 %
Ties, k = L44
On the level line L = 18,921
Forced level, l ≤ d²2
Range of a(n)4 … 200,633
Range of the jump d2 … 3
Largest weight k, level L200,609, 66,877

The gaps are 2 and 3; the level share is 13.76 %; L = 1 holds 65 % of the level class.

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.