cp's OEIS Frontend

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.

%I A265115 #5 Aug 12 2016 07:05:16
%S A265115 1,0,8,0,16,0,168,0,1048,0,14814,0,300322,0
%N 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.
%C A265115 Column 3 of A265117.
%e A265115 Some solutions for n=7
%e A265115 ..0..4..5....0..4..5....0..4..5....1..3..5....2..6..1....6..3..0....4..5..0
%e A265115 ..5..1..3....6..2..1....5..0..4....5..2..2....1..4..4....0..4..5....0..6..3
%e A265115 ..3..0..6....2..3..4....4..2..3....2..1..6....4..5..0....5..0..4....3..0..6
%e A265115 ..6..2..1....5..4..0....3..5..1....6..0..3....0..3..6....4..2..3....6..1..2
%e A265115 ..1..6..2....1..3..5....1..6..2....3..6..0....6..0..3....3..5..1....2..2..5
%e A265115 ..2..3..4....6..3..0....2..1..6....0..5..4....3..1..5....1..6..2....5..3..1
%e A265115 ..4..5..0....1..2..6....6..3..0....4..4..1....5..2..2....2..1..6....1..4..4
%Y A265115 Cf. A265117.
%K A265115 nonn
%O A265115 1,3
%A A265115 _R. H. Hardin_, Dec 01 2015