Good primes (version 1): prime(n)^2 > prime(n-1)*prime(n+1)

Open in the 3-D viewerA046869 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 30,850 · 30.85 % |
| Weight class, k ≤ L | 69,147 · 69.15 % |
| Ties, k = L | 20 |
| On the level line L = 1 | 9,037 |
| Forced level, l ≤ d² | 16 |
| Range of a(n) | 5 … 2,643,733 |
| Range of the jump d | 4 … 182 |
| Largest weight k, level L | 2,643,647, 377,337 |
82 different gaps occur, from 4 to 182; the level share is 30.85 %.
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.