A227588 - cp's OEIS frontend

A227588 Maximum label within a minimal labeling of k >= 0 identical n-sided dice (n >= 1) yielding the most possible sums; square array A(n,k), read by antidiagonals.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	3
9	2
10	1
11	1
12	4
13	4
14	2
15	1
16	1
17	5
18	7
19	5
20	2
21	1
22	1
23	6
24	12
25	12
26	6
27	2
28	1
29	1
30	7
31	18
32	24
33	16
34	7
35	2
36	1
37	1
38	8
39	26
40	46
41	42
42	23
43	8
44	2
45	1
46	1
47	9
48	35
49	83
50	101
51	73
52	29
53	9
54	2
55	1

[1, 1, 1, 1, 2, 1, 1, 3, 2, 1, 1, 4, 4, 2, 1, 1, 5, 7, 5, 2, 1, 1, 6, 12, 12, 6, 2, 1, 1, 7, 18, 24, 16, 7, 2, 1, 1, 8, 26, 46, 42, 23, 8, 2, 1, 1, 9, 35, 83, 101, 73, 29, 9, 2, 1]

cp's OEIS Frontend

A227588 Maximum label within a minimal labeling of k >= 0 identical n-sided dice (n >= 1) yielding the most possible sums; square array A(n,k), read by antidiagonals.

Table of values

List of values

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	3
9	2
10	1
11	1
12	4
13	4
14	2
15	1
16	1
17	5
18	7
19	5
20	2
21	1
22	1
23	6
24	12
25	12
26	6
27	2
28	1
29	1
30	7
31	18
32	24
33	16
34	7
35	2
36	1
37	1
38	8
39	26
40	46
41	42
42	23
43	8
44	2
45	1
46	1
47	9
48	35
49	83
50	101
51	73
52	29
53	9
54	2
55	1

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	3
9	2
10	1
11	1
12	4
13	4
14	2
15	1
16	1
17	5
18	7
19	5
20	2
21	1
22	1
23	6
24	12
25	12
26	6
27	2
28	1
29	1
30	7
31	18
32	24
33	16
34	7
35	2
36	1
37	1
38	8
39	26
40	46
41	42
42	23
43	8
44	2
45	1
46	1
47	9
48	35
49	83
50	101
51	73
52	29
53	9
54	2
55	1

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	3
9	2
10	1
11	1
12	4
13	4
14	2
15	1
16	1
17	5
18	7
19	5
20	2
21	1
22	1
23	6
24	12
25	12
26	6
27	2
28	1
29	1
30	7
31	18
32	24
33	16
34	7
35	2
36	1
37	1
38	8
39	26
40	46
41	42
42	23
43	8
44	2
45	1
46	1
47	9
48	35
49	83
50	101
51	73
52	29
53	9
54	2
55	1