Numbers that are a product of 2 triangular numbers

Open in the 3-D viewerA085780 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,995 |
| Level class, k > L | 42,168 · 42.17 % |
| Weight class, k ≤ L | 57,827 · 57.83 % |
| Ties, k = L | 1 |
| On the level line L = 1 | 960 |
| Forced level, l ≤ d² | 760 |
| Range of a(n) | 0 … 125,167,770 |
| Range of the jump d | 1 … 15,457 |
| Largest weight k, level L | 125,091,467, 62,027,437 |
5,749 different gaps occur, from 1 to 15,457; the level share is 42.17 %.
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.