The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A227378 Smallest number with n = sum of distinct digits in decimal representation, cf. A217928. 2
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS A217928(a(n)) = A007953(a(n)) = n and A217928(m) < n for m < a(n). LINKS PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a227378 = fromJust . (`elemIndex` a217928_list) CROSSREFS Sequence in context: A317110 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 28 17:37 EDT 2020. Contains 334684 sequences. (Running on oeis4.)