|
|
A265117
|
|
T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.
|
|
4
|
|
|
1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 8, 0, 0, 1, 0, 6, 0, 0, 0, 1, 0, 10, 624, 16, 0, 0, 1, 0, 26, 0, 6592, 0, 0, 0, 1, 0, 42, 10110, 8140944, 126764, 168, 0, 0, 1, 0, 70, 0, 195568740, 0, 3493730, 0, 0, 0, 1, 0, 150, 300744
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,13
|
|
COMMENTS
|
Table starts
.1.1...1.......1.......1.........1..1......1...1.1.1
.0.0...0.......0.......0.........0..0......0...0.0
.0.0...8.......6......10........26.42.....70.150
.0.0...0.....624.......0.....10110..0.300744
.0.0..16....6592.8140944.195568740
.0.0...0..126764.......0
.0.0.168.3493730
.0.0...0
.0.0
.0
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4 k=4
..3..1..2..0....1..3..2..0....1..3..2..0....3..3..0..0....1..0..3..2
..1..0..3..2....3..0..2..1....2..0..1..3....0..0..3..3....3..2..1..0
..2..3..0..1....1..3..0..2....0..2..1..3....1..1..2..2....0..1..2..3
..0..2..1..3....1..0..2..3....3..1..2..0....2..2..1..1....2..3..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|