A227378 Smallest number with n = sum of distinct digits in decimal representation, cf. A217928.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 29, 39, 49, 59, 69, 79, 89, 189, 289, 389, 489, 589, 689, 789, 1789, 2789, 3789, 4789, 5789, 6789, 16789, 26789, 36789, 46789, 56789, 156789, 256789, 356789, 456789, 1456789, 2456789, 3456789, 13456789, 23456789, 123456789

Offset

0,3

Comments

A217928(a(n)) = A007953(a(n)) = n and A217928(m) < n for m < a(n).

Links

Table of n, a(n) for n=0..45.

Prog

(Haskell)
import Data.List (elemIndex); import Data.Maybe (fromJust)
a227378 = fromJust . (`elemIndex` a217928_list)

Crossrefs

Sequence in context: A340254 A190876 A051885 * A226637 A274841 A247227

Adjacent sequences: A227375 A227376 A227377 * A227379 A227380 A227381

Keyword

nonn,base,fini,full

Author

Reinhard Zumkeller, Jul 09 2013

Status

approved