This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A217928 Sum of distinct decimal digits appearing in n. 5
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 1, 3, 4, 5, 6, 7, 8, 9, 10, 2, 3, 2, 5, 6, 7, 8, 9, 10, 11, 3, 4, 5, 3, 7, 8, 9, 10, 11, 12, 4, 5, 6, 7, 4, 9, 10, 11, 12, 13, 5, 6, 7, 8, 9, 5, 11, 12, 13, 14, 6, 7, 8, 9, 10, 11, 6, 13, 14, 15, 7, 8, 9, 10, 11, 12, 13, 7, 15, 16, 8, 9, 10, 11, 12, 13, 14, 15, 8, 17, 9, 10, 11, 12, 13, 14, 15, 16, 17, 9, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) <= 45 = 1+2+3+4+5+6+7+8+9; A227378(n) = smallest number m such that a(m) = n, 0 <= n <= 45. - Reinhard Zumkeller, Jul 09 2013 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (PARI) { a(n) = local( d = vecsort( eval(Vec(Str(n))), , 8) ); sum(i=1, #d, d[i]) } (Haskell) import Data.List (nub) a217928 = sum . nub . map (read . return) . show :: Integer -> Integer -- Reinhard Zumkeller, Jul 09 2013 CROSSREFS Cf. A007953 Sequence in context: A051801 A071205 A066750 * A222493 A032762 A180410 Adjacent sequences:  A217925 A217926 A217927 * A217929 A217930 A217931 KEYWORD base,easy,nonn AUTHOR Max Alekseyev, Oct 15 2012 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 September 16 10:36 EDT 2019. Contains 327094 sequences. (Running on oeis4.)