A265115 Number of nX3 arrays containing 3 copies of 0..n-1 with row sums equal, column sums equal and full-length antidiagonal sums equal to the short dimension sums.
1, 0, 8, 0, 16, 0, 168, 0, 1048, 0, 14814, 0, 300322, 0
Offset: 1
Keywords
Examples
Some solutions for n=7 ..0..4..5....0..4..5....0..4..5....1..3..5....2..6..1....6..3..0....4..5..0 ..5..1..3....6..2..1....5..0..4....5..2..2....1..4..4....0..4..5....0..6..3 ..3..0..6....2..3..4....4..2..3....2..1..6....4..5..0....5..0..4....3..0..6 ..6..2..1....5..4..0....3..5..1....6..0..3....0..3..6....4..2..3....6..1..2 ..1..6..2....1..3..5....1..6..2....3..6..0....6..0..3....3..5..1....2..2..5 ..2..3..4....6..3..0....2..1..6....0..5..4....3..1..5....1..6..2....5..3..1 ..4..5..0....1..2..6....6..3..0....4..4..1....5..2..2....2..1..6....1..4..4
Crossrefs
Cf. A265117.
Comments