Numbers n such that n^2 + n + 1 is a semiprime

Open in the 3-D viewerA085746 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,999 |
| Level class, k > L | 17,214 · 17.21 % |
| Weight class, k ≤ L | 82,785 · 82.79 % |
| Ties, k = L | 46 |
| On the level line L = 1 | 9,492 |
| Forced level, l ≤ d² | 2 |
| Range of a(n) | 4 … 354,073 |
| Range of the jump d | 1 … 31 |
| Largest weight k, level L | 354,037, 177,036 |
31 different gaps occur, from 1 to 31; the level share is 17.21 %; L = 1 holds 55 % 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.