decompwlj 3D

a(n) = (2*n - 1)*n^2

A015237 on the OEIS · family polynomial

Weight–level plate of a(n) = (2*n - 1)*n^2
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 viewerA015237 on the OEIS
Terms100,000 (n = 0 … 99,999)
Decomposable (a > 2d)99,992
Level class, k > L99,992 · 100.00 %
Weight class, k ≤ L0 · 0.00 %
Ties, k = L0
On the level line L = 18,013
Forced level, l ≤ d²99,992
Range of a(n)0 … 1,999,930,000,799,997
Range of the jump d1 … 59,999,200,003
Largest weight k, level L1,998,970,175,590,079, 33,313

Every gap is different, from 1 to 59,999,200,003; every decomposable term is forced level (l <= d^2); 8 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.