|
%I #4 Nov 26 2013 21:03:20
%S 5,13,13,23,45,105,297,583,1419,4299,10947,26515,72045,204387,535111,
%T 1466497,4049473,11241601,31897667,87429003,245101773,698228801,
%U 1965757385,5494808427,15568542609,44541579873,125744419037,358349911597
%N Number of (n+1)X(2+1) 0..2 arrays x(i,j) with every row sum{j*x(i,j), j=1..2+1} equal, and every column sum{i*x(i,j), i=1..n+1} equal
%C Column 2 of A232614
%H R. H. Hardin, <a href="/A232610/b232610.txt">Table of n, a(n) for n = 1..48</a>
%e Some solutions for n=3
%e ..1..1..1....2..2..0....2..2..1....0..0..2....2..2..0....0..0..1....0..0..2
%e ..1..1..1....0..0..2....1..1..2....2..2..0....2..2..0....1..1..0....0..0..2
%e ..1..1..1....0..0..2....1..1..2....2..2..0....0..0..2....1..1..0....2..2..0
%e ..1..1..1....2..2..0....2..2..1....0..0..2....1..1..1....0..0..1....1..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Nov 26 2013
|
