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