Greater of twin primes

Open in the 3-D viewerA006512 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,998 |
| Level class, k > L | 46,930 · 46.93 % |
| Weight class, k ≤ L | 53,068 · 53.07 % |
| Ties, k = L | 29 |
| On the level line L = 1 | 17,537 |
| Forced level, l ≤ d² | 185 |
| Range of a(n) | 5 … 18,409,201 |
| Range of the jump d | 2 … 2,190 |
| Largest weight k, level L | 18,407,929, 2,617,951 |
Past 5, every term is 1 mod 6, so l = 1 (mod 6): squares are possible and 29 ties occur, where the lesser twins (l = 5 mod 6) have none. The level share, 46.93 %, is close to the lesser twins' 47.77 %.
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.