Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Aug 12 2016 07:05:16
%S 1,0,8,0,16,0,168,0,1048,0,14814,0,300322,0
%N 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.
%C Column 3 of A265117.
%e Some solutions for n=7
%e ..0..4..5....0..4..5....0..4..5....1..3..5....2..6..1....6..3..0....4..5..0
%e ..5..1..3....6..2..1....5..0..4....5..2..2....1..4..4....0..4..5....0..6..3
%e ..3..0..6....2..3..4....4..2..3....2..1..6....4..5..0....5..0..4....3..0..6
%e ..6..2..1....5..4..0....3..5..1....6..0..3....0..3..6....4..2..3....6..1..2
%e ..1..6..2....1..3..5....1..6..2....3..6..0....6..0..3....3..5..1....2..2..5
%e ..2..3..4....6..3..0....2..1..6....0..5..4....3..1..5....1..6..2....5..3..1
%e ..4..5..0....1..2..6....6..3..0....4..4..1....5..2..2....2..1..6....1..4..4
%Y Cf. A265117.
%K nonn
%O 1,3
%A _R. H. Hardin_, Dec 01 2015