|
%I #6 Aug 19 2022 13:49:52
%S 16,47,130,319,755,1680,3673,7751,16254,33352,68448,138469,281122,
%T 564810,1140621,2284335,4601127,9201288,18508319,36987885,74343834,
%U 148524185,298379462,596003105,1196923732,2390589937,4799574872,9585538381
%N Number of (2+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..2+1} nondecreasing.
%C Row 2 of A233062.
%H R. H. Hardin, <a href="/A233063/b233063.txt">Table of n, a(n) for n = 1..161</a>
%e Some solutions for n=5
%e ..0..0..1..0..0..1....0..0..1..1..0..1....0..0..1..0..0..0....0..0..1..0..1..1
%e ..0..0..0..1..1..1....0..0..1..0..1..1....0..0..1..0..0..1....0..0..1..0..1..1
%e ..1..1..1..1..1..1....0..1..0..1..1..1....0..1..0..1..1..1....1..1..0..1..0..1
%Y Cf. A233062.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 03 2013
|
