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!)
 A047843 Describe n: give frequency of each digit, by increasing size; mention also missing digits between the smallest and largest one. 3

%I

%S 10,11,12,13,14,15,16,17,18,19,1011,21,1112,110213,11020314,

%T 1102030415,110203040516,11020304050617,1102030405060718,

%U 110203040506070819,100112,1112,22,1213,120314,12030415,1203040516

%N Describe n: give frequency of each digit, by increasing size; mention also missing digits between the smallest and largest one.

%C 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

%H Vincenzo Librandi, <a href="/A047843/b047843.txt">Table of n, a(n) for n = 0..5000</a>

%e 131 contains two 1's, zero 2's and one 3, so a(131) = 210213.

%t 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];

%t a /@ Range[0, 26] (* _Jean-François Alcover_, Jan 07 2020 *)

%o (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

%Y Cf. A005151, A047841, A047842.

%K nonn,easy,base,nice

%O 0,1

%A _N. J. A. Sloane_

%E More accurate title from _M. F. Hasler_, Feb 25 2018

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 August 9 20:09 EDT 2020. Contains 336326 sequences. (Running on oeis4.)