A265089 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal and column sums equal.
1, 1, 0, 1, 2, 0, 1, 0, 6, 0, 1, 6, 12, 24, 0, 1, 0, 90, 0, 120, 0, 1, 20, 360, 4464, 1080, 720, 0, 1, 0, 2040, 0, 493920, 0, 6300, 0, 1, 70, 10080, 2850360, 75502080, 128269440, 3135720, 45360, 0, 1, 0, 54810, 0, 16074373800, 0, 57943903500, 0, 589680, 0, 1, 252
Offset: 1
Examples
Some solutions for n=4 k=4 ..3..0..1..2....0..3..3..0....1..1..2..2....3..1..2..0....1..0..3..2 ..3..1..2..0....3..0..0..3....2..3..0..1....3..1..0..2....1..2..0..3 ..0..2..1..3....1..1..2..2....0..2..1..3....0..1..3..2....2..1..3..0 ..0..3..2..1....2..2..1..1....3..0..3..0....0..3..1..2....2..3..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..60
Comments