decompwlj 3D

Prime(n) such that 4 does not divide the difference between prime(n) and prime(n+1)

A098058 on the OEIS · family primes

Weight–level plate of Prime(n) such that 4 does not divide the difference between prime(n) and prime(n+1)
Click the plate to explore it in 3-D. Weight k across, level L up, both on log scales: blue in the weight class (k ≤ L), orange in the level class (k > L). The dashed diagonal is k = L.
Open in the 3-D viewerA098058 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,996
Level class, k > L28,110 · 28.11 %
Weight class, k ≤ L71,886 · 71.89 %
Ties, k = L9
On the level line L = 18,610
Forced level, l ≤ d²16
Range of a(n)2 … 2,386,939
Range of the jump d1 … 246
Largest weight k, level L2,386,921, 795,489

59 different gaps occur, from 1 to 246; the level share is 28.11 %; 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.