The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047843 Describe n: give frequency of each digit, by increasing size; mention also missing digits between the smallest and largest one. 3
 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1011, 21, 1112, 110213, 11020314, 1102030415, 110203040516, 11020304050617, 1102030405060718, 110203040506070819, 100112, 1112, 22, 1213, 120314, 12030415, 1203040516 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS Other methods to describe or summarize n are: A047842 (as here, but ignoring "missing" digits), A244112 (count digits in order of decreasing size, ignoring missing digits). - M. F. Hasler, Feb 25 2018 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..5000 EXAMPLE 131 contains two 1's, zero 2's and one 3, so a(131) = 210213. MATHEMATICA a[n_] := Module[{T, f}, T = Tally[IntegerDigits[n]]; f[_] = 0; Do[f[t[[1]]] = t[[2]], {t, T}]; Table[{f[k], k}, {k, Min@T[[All, 1]], Max@T[[All, 1]]} ] // Flatten // FromDigits]; a /@ Range[0, 26] (* Jean-François Alcover, Jan 07 2020 *) PROG (PARI) A047843(n, S="")={if(n, for(d=vecmin(n=digits(n)), vecmax(n), S=Str(S, #select(t->t==d, n), d)); eval(S), 10)} \\ M. F. Hasler, Feb 25 2018 CROSSREFS Cf. A005151, A047841, A047842. Sequence in context: A250040 A321485 A047842 * A097598 A045918 A244112 Adjacent sequences: A047840 A047841 A047842 * A047844 A047845 A047846 KEYWORD nonn,easy,base,nice AUTHOR N. J. A. Sloane EXTENSIONS More accurate title from M. F. Hasler, Feb 25 2018 STATUS approved

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

Last modified September 29 03:24 EDT 2023. Contains 365749 sequences. (Running on oeis4.)