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.
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.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =15a(4) =1a(5) =71a(6) =1a(7) =280a(8) =15a(9) =71a(10) =1a(11) =3660a(12) =1a(13) =71a(14) =71a(15) =5775a(16) =1a(17) =3660a(18) =1a(19) =3660a(20) =71a(21) =71a(22) =1a(23) =160440a(24) =15a(25) =71a(26) =280a(27) =3660a(28) =1a(29) =20365
External references
- oeis: A131514