A360439 - cp's OEIS frontend

A360439 Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable (p^nq)-sided dice so that it is possible to roll every number from 0 to (p^nq)^k-1, where p and q are distinct primes.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	7
9	1
10	1
11	1
12	42
13	71
14	1
15	1
16	1
17	230
18	3660
19	1001
20	1
21	1
22	1
23	1190
24	160440
25	614040
26	18089
27	1
28	1
29	1
30	5922
31	6387150
32	299145000
33	169200360
34	398959
35	1
36	1
37	1
38	28644
39	238504266
40	127534407000
41	1175153779800
42	69444920160
43	10391023
44	1

[1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 42, 71, 1, 1, 1, 230, 3660, 1001, 1, 1, 1, 1190, 160440, 614040, 18089, 1, 1, 1, 5922, 6387150, 299145000, 169200360, 398959, 1, 1, 1, 28644, 238504266, 127534407000, 1175153779800, 69444920160, 10391023, 1]

cp's OEIS Frontend

A360439 Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable (p^nq)-sided dice so that it is possible to roll every number from 0 to (p^nq)^k-1, where p and q are distinct primes.

Table of values

List of values

cp's OEIS Frontend

A360439 Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable (p^n*q)-sided dice so that it is possible to roll every number from 0 to (p^n*q)^k-1, where p and q are distinct primes.

Table of values

List of values

A360439 Square array read by antidiagonals upwards: T(n,k), n>=0, k>=0, is the number of ways of choosing nonnegative numbers for k indistinguishable (p^nq)-sided dice so that it is possible to roll every number from 0 to (p^nq)^k-1, where p and q are distinct primes.