Consecutive Descending Digit Runs

Rule, exact count and rarity

A descending run is a consecutive fragment of at least three decimal digits that step down by one each time. Digits before or after that fragment need not be ordered. The engine checks for two consecutive differences of minus one and excludes numbers that already form a complete descending sequence. A fragment ending in zero is valid, but zero cannot wrap to nine. Multiple qualifying fragments still produce one match for this pattern. The distinction is structural: a long number with one small ordered section differs from a number ordered throughout. Membership in this category says nothing by itself about factors or digit sums, which are evaluated as separate sources of information by the scoring engine.

The exact count, 29,815, comes from evaluating all 1,000,001 integers from 0 through 1,000,000, including both endpoints. It is not a sample or an estimate. Each matching integer is counted once for this category, even if it contains multiple qualifying segments. Its frequency of 2.981497% describes the chance that a uniformly chosen integer passes this one test. It is not the global score percentile of every member, and overlapping pattern counts must not be added as if they represented disjoint sets.

The pattern supplies −log₂(29,815 / 1,000,001) bits before its within-family weight is applied. Other matched patterns, digit sum, distinct-digit count and short-length signals can change the complete score. Consequently, members of this category need not share a ranking. The highest-scoring representative is 12,321, with a rarity score of 831 and Top 0.015%. This uses its complete score across all features, not just this pattern. Equal scores are displayed in ascending numerical order.

Example numbers

The highest-scoring match

The highest-scoring representative is 12,321, with a rarity score of 831 and Top 0.015%. This uses its complete score across all features, not just this pattern. Equal scores are displayed in ascending numerical order.