WOLFRAM|DEMONSTRATIONS PROJECT

Self-Descriptive Strings

​
number of digits m
10
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
0
1
2
3
4
5
6
7
8
9
1
1
1
1
1
1
1
1
1
1
False
For some
m
,
3≤m≤10
, find a list of
m
numbers
n
0,
n
1
,…,
n
m-1
with the property that
n
i
is the number of times
i
occurs in the list for all
i=0,1,...,m-1
.