decompwlj 3D

Numbers k such that Fibonacci(k) == 1 (mod k)

A023173 on the OEIS · family self-referential

Weight–level plate of Numbers k such that Fibonacci(k) == 1 (mod k)
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 viewerA023173 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,997
Level class, k > L19,559 · 19.56 %
Weight class, k ≤ L80,438 · 80.44 %
Ties, k = L4
On the level line L = 15,229
Forced level, l ≤ d²12
Range of a(n)1 … 1,736,981
Range of the jump d1 … 177
Largest weight k, level L1,736,927, 868,110

122 different gaps occur, from 1 to 177; the level share is 19.56 %.

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.