A131514 - cp's OEIS frontend

A131514 Number of ways to design a set of three n-sided dice (using nonnegative integers) such that summing the faces can give any integer from 0 to n^3 - 1.

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

[1, 1, 1, 15, 1, 71, 1, 280, 15, 71, 1, 3660, 1, 71, 71, 5775, 1, 3660, 1, 3660, 71, 71, 1, 160440, 15, 71, 280, 3660, 1, 20365, 1, 126126, 71, 71, 71, 415185, 1, 71, 71, 160440, 1, 20365, 1, 3660, 3660, 71, 1, 6387150, 15, 3660, 71, 3660, 1, 160440, 71, 160440]

cp's OEIS Frontend

A131514 Number of ways to design a set of three n-sided dice (using nonnegative integers) such that summing the faces can give any integer from 0 to n^3 - 1.

Table of values

List of values