A360098 - cp's OEIS frontend

A360098 Square array read by antidiagonals upwards: T(n,k) is the number of ways of choosing nonnegative numbers for k n-sided dice, k >= 0, n >= 1, so that summing the faces can give any integer from 0 to n^k - 1.

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

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 15, 1, 1, 1, 1, 1, 7, 1, 105, 1, 1, 1, 1, 1, 1, 71, 1, 945, 1, 1, 1, 1, 1, 10, 1, 1001, 1, 10395, 1, 1, 1, 1, 1, 3, 280, 1, 18089, 1, 135135, 1, 1, 1, 1, 1, 7, 15, 15400, 1, 398959, 1]

cp's OEIS Frontend

A360098 Square array read by antidiagonals upwards: T(n,k) is the number of ways of choosing nonnegative numbers for k n-sided dice, k >= 0, n >= 1, so that summing the faces can give any integer from 0 to n^k - 1.

Table of values

List of values