decompwlj 3D

Numbers in which every pair of adjacent digits are distinct

A043096 on the OEIS · family digit rule

Weight–level plate of Numbers in which every pair of adjacent digits are distinct
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 viewerA043096 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,997
Level class, k > L9,699 · 9.70 %
Weight class, k ≤ L90,298 · 90.30 %
Ties, k = L49
On the level line L = 19,012
Forced level, l ≤ d²27
Range of a(n)0 … 161,049
Range of the jump d1 … 10,203
Largest weight k, level L161,047, 80,524

10 different gaps occur, from 1 to 10,203; the level share is 9.70 %; L = 1 holds 93 % 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.