|
%I #4 Dec 04 2013 07:55:03
%S 464,11741,252958,4736663,79223727,1206772195,16999415895,
%T 224076967817,2789987429279,33062492784645,375228791717746,
%U 4099407920673301,43300262048665772,443810526543291788,4427981986413355672
%N Number of (3+1)X(n+1) 0..2 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 A233117
%H R. H. Hardin, <a href="/A233120/b233120.txt">Table of n, a(n) for n = 1..16</a>
%e Some solutions for n=2
%e ..0..1..0....0..2..0....0..0..0....0..1..2....1..0..1....0..0..2....1..0..2
%e ..1..0..1....0..1..1....0..2..1....1..1..1....2..2..0....2..2..1....2..1..0
%e ..1..0..2....2..0..2....2..0..1....0..1..2....1..1..2....1..2..2....2..1..1
%e ..1..2..1....1..2..2....1..2..2....2..1..0....0..2..2....1..2..2....0..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 04 2013
| 