decompwlj 3D

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

A230854 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 two solutions
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 viewerA230854 on the OEIS
Terms100,000 (n = 1 … 100,000)
Decomposable (a > 2d)99,999
Level class, k > L11,318 · 11.32 %
Weight class, k ≤ L88,681 · 88.68 %
Ties, k = L2
On the level line L = 10
Forced level, l ≤ d²3
Range of a(n)4 … 302,022
Range of the jump d2 … 24
Largest weight k, level L151,009, 100,670

8 different gaps occur, from 2 to 24; the level share is 11.32 %; L = 2 holds 81 % 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.