%I #5 Dec 04 2013 07:51:41
%S 29,123,464,1636,5523,18027,57505,180104,557624,1710232,5214096,
%T 15814973,47828131,144246386,434433284,1306430965,3926428842,
%U 11790818795,35400533788,106233224821,318796252622,956379509076,2869363937351
%N Number of (n+1)X(1+1) 0..2 arrays x(i,j) with row sums sum{x(i,j), j=1..1+1} nondecreasing, and column sums sum{i*x(i,j), i=1..n+1} nondecreasing
%C Column 1 of A233117
%H R. H. Hardin, <a href="/A233114/b233114.txt">Table of n, a(n) for n = 1..34</a>
%e Some solutions for n=5
%e ..0..1....0..1....1..1....1..0....1..1....0..1....2..0....1..0....0..1....1..0
%e ..0..1....1..0....0..2....1..0....1..1....0..2....2..0....0..1....2..0....1..0
%e ..0..2....0..1....1..1....0..2....1..1....0..2....2..0....0..2....1..2....0..2
%e ..1..1....0..1....0..2....1..2....1..1....0..2....1..1....0..2....2..1....1..2
%e ..2..0....1..2....1..1....1..2....1..2....2..0....0..2....2..0....1..2....2..1
%e ..1..2....1..2....2..1....2..2....1..2....2..1....0..2....0..2....1..2....2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 04 2013
|