|
Search: id:A047842
|
|
|
| A047842 |
|
Describe n (ignoring missing digits). |
|
+0
11
|
|
| 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 1011, 21, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1012, 1112, 22, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1013, 1113, 1213, 23, 1314, 1315, 1316, 1317, 1318, 1319, 1014, 1114, 1214, 1314, 24, 1415, 1416
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Digit count of n. The digit count numerically summarizes the frequency of digits 0 through 9 in that order when they occur in a number. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jan 11 2007
Numbers which are digital permutations of one another have the same digit count. Compare with first entries of "Look And Say " or LS sequence A045918. As in the latter, a(n) has first odd-numbered-digit entry occurring at n=1111111111 with digit count 101, but a(n) has first ambiguous term 1011. For digit count invariants, i.e. n such that a(n)=n, see A047841. - Lekraj Beedassy (blekraj(AT)yahoo.com), Jan 11 2007
|
|
EXAMPLE
|
a(31)=1113 because (one 1, one 3) make up 31.
101 contains one 0 and two 1's, so a(101)=1021. a(131)=2113.
|
|
MATHEMATICA
|
dc[n_] :=FromDigits@Flatten@Select[Table[{DigitCount[n, 10, k], k}, {k, 0, 9}], #[[1]] > 0 &]; Table[dc[n], {n, 0, 46}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A005151, A047841, A047843, A127354, A127355.
Sequence in context: A076161 A131835 A102236 this_sequence A047843 A097598 A045918
Adjacent sequences: A047839 A047840 A047841 this_sequence A047843 A047844 A047845
|
|
KEYWORD
|
nonn,easy,base,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 03 2008 at the suggestion of R. J. Mathar
|
|
|
Search completed in 0.002 seconds
|
