decompwlj 3D

Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly one solution

A230853 on the OEIS · family digit rule

Weight–level plate of Numbers n such that m + (sum of digits in base-3 representation of m) = n has exactly one solution
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 viewerA230853 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,996
Level class, k > L20,257 · 20.26 %
Weight class, k ≤ L79,739 · 79.74 %
Ties, k = L1
On the level line L = 11
Forced level, l ≤ d²14
Range of a(n)0 … 1,158,452
Range of the jump d2 … 36
Largest weight k, level L579,179, 128,712

13 different gaps occur, from 2 to 36; the level share is 20.26 %; L = 2 holds 40 % 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.