A364362 - cp's OEIS frontend

A364362 Consider all the ways to make sequences of distinct nonnegative integers using all the digits of n, such that no term has leading 0's or appears more than once in the sequence. a(n) is the minimum possible sum of any sequence of n.

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	6
7	7
8	8
9	9
10	1
11	11
12	3
13	4
14	5
15	6
16	7
17	8
18	9
19	10
20	2
21	3
22	22
23	5
24	6
25	7
26	8
27	9
28	10
29	11
30	3
31	4
32	5
33	33
34	7
35	8
36	9
37	10
38	11
39	12
40	4
41	5
42	6
43	7
44	44
45	9
46	10
47	11
48	12
49	13
50	5
51	6
52	7
53	8
54	9
55	55
56	11
57	12
58	13
59	14
60	6
61	7
62	8
63	9
64	10
65	11
66	66
67	13
68	14
69	15
70	7
71	8
72	9
73	10
74	11
75	12
76	13

[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 11, 3, 4, 5, 6, 7, 8, 9, 10, 2, 3, 22, 5, 6, 7, 8, 9, 10, 11, 3, 4, 5, 33, 7, 8, 9, 10, 11, 12, 4, 5, 6, 7, 44, 9, 10, 11, 12, 13, 5, 6, 7, 8, 9, 55, 11, 12, 13, 14, 6, 7, 8, 9, 10, 11, 66, 13, 14, 15, 7, 8, 9, 10, 11, 12, 13]

cp's OEIS Frontend

A364362 Consider all the ways to make sequences of distinct nonnegative integers using all the digits of n, such that no term has leading 0's or appears more than once in the sequence. a(n) is the minimum possible sum of any sequence of n.

Table of values

List of values

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	6
7	7
8	8
9	9
10	1
11	11
12	3
13	4
14	5
15	6
16	7
17	8
18	9
19	10
20	2
21	3
22	22
23	5
24	6
25	7
26	8
27	9
28	10
29	11
30	3
31	4
32	5
33	33
34	7
35	8
36	9
37	10
38	11
39	12
40	4
41	5
42	6
43	7
44	44
45	9
46	10
47	11
48	12
49	13
50	5
51	6
52	7
53	8
54	9
55	55
56	11
57	12
58	13
59	14
60	6
61	7
62	8
63	9
64	10
65	11
66	66
67	13
68	14
69	15
70	7
71	8
72	9
73	10
74	11
75	12
76	13

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	6
7	7
8	8
9	9
10	1
11	11
12	3
13	4
14	5
15	6
16	7
17	8
18	9
19	10
20	2
21	3
22	22
23	5
24	6
25	7
26	8
27	9
28	10
29	11
30	3
31	4
32	5
33	33
34	7
35	8
36	9
37	10
38	11
39	12
40	4
41	5
42	6
43	7
44	44
45	9
46	10
47	11
48	12
49	13
50	5
51	6
52	7
53	8
54	9
55	55
56	11
57	12
58	13
59	14
60	6
61	7
62	8
63	9
64	10
65	11
66	66
67	13
68	14
69	15
70	7
71	8
72	9
73	10
74	11
75	12
76	13

n	a(n)
0	0
1	1
2	2
3	3
4	4
5	5
6	6
7	7
8	8
9	9
10	1
11	11
12	3
13	4
14	5
15	6
16	7
17	8
18	9
19	10
20	2
21	3
22	22
23	5
24	6
25	7
26	8
27	9
28	10
29	11
30	3
31	4
32	5
33	33
34	7
35	8
36	9
37	10
38	11
39	12
40	4
41	5
42	6
43	7
44	44
45	9
46	10
47	11
48	12
49	13
50	5
51	6
52	7
53	8
54	9
55	55
56	11
57	12
58	13
59	14
60	6
61	7
62	8
63	9
64	10
65	11
66	66
67	13
68	14
69	15
70	7
71	8
72	9
73	10
74	11
75	12
76	13