|
%I #4 Dec 03 2013 19:34:29
%S 33,161,723,2875,10650,36674,119979,373955,1122568,3255885,9181781,
%T 25238126,67893216,179078191,464403265,1185772147,2986754467,
%U 7429480493,18276519761,44500586535,107358553904,256796921471,609508203405
%N Number of (3+1)X(n+1) 0..1 arrays x(i,j) with row sums sum{x(i,j), j=1..n+1} nondecreasing, and column sums sum{i*x(i,j), i=1..3+1} nondecreasing
%C Row 3 of A233062
%H R. H. Hardin, <a href="/A233064/b233064.txt">Table of n, a(n) for n = 1..48</a>
%e Some solutions for n=5
%e ..0..1..0..1..1..1....1..0..1..1..0..0....0..0..1..1..0..1....1..0..0..1..0..0
%e ..1..0..1..1..1..1....0..1..1..1..0..0....0..0..1..0..1..1....0..1..1..0..0..1
%e ..1..0..1..1..1..1....1..1..0..0..1..1....1..1..0..1..1..1....0..0..1..0..1..1
%e ..0..1..1..1..1..1....0..0..1..1..1..1....1..1..1..1..1..1....0..0..0..1..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 03 2013
|
