Symmetric primes: an odd prime p is symmetric if there exists an odd prime q such that |p-q| = gcd(p-1,q-1)

Open in the 3-D viewerA090190 on the OEIS
| Terms | 100,000 (n = 1 … 100,000) |
|---|---|
| Decomposable (a > 2d) | 99,997 |
| Level class, k > L | 23,823 · 23.82 % |
| Weight class, k ≤ L | 76,174 · 76.18 % |
| Ties, k = L | 20 |
| On the level line L = 1 | 7,332 |
| Forced level, l ≤ d² | 9 |
| Range of a(n) | 3 … 1,586,719 |
| Range of the jump d | 2 … 192 |
| Largest weight k, level L | 1,586,527, 528,873 |
75 different gaps occur, from 2 to 192; the level share is 23.82 %; L = 1 holds 31 % 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.