A268367 T(n,k) = Number of n X k arrays containing k copies of 0..n-1 with row sums equal.
1, 1, 0, 1, 4, 0, 1, 0, 12, 0, 1, 36, 216, 96, 0, 1, 0, 2700, 0, 480, 0, 1, 400, 54000, 643680, 116640, 5760, 0, 1, 0, 1054200, 0, 190188000, 0, 40320, 0, 1, 4900, 20991600, 12243840000, 269568000000, 128247235200, 535610880, 645120, 0, 1, 0, 445365900
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..0..2..1....0..2..1..1....0..1..2..1....2..1..1..0....1..0..2..1 ..0..0..2..2....1..1..2..0....2..1..0..1....2..0..1..1....0..2..0..2 ..1..2..0..1....0..0..2..2....2..2..0..0....0..2..0..2....0..2..1..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..59
Comments