Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Mar 28 2013 16:40:00
%S 3,9,9,22,81,22,46,564,564,46,86,3298,11264,3298,86,148,17048,187103,
%T 187103,17048,148,239,80412,2719602,8878492,2719602,80412,239,367,
%U 353485,35688774,367772497,367772497,35688774,353485,367,541,1469903,432076735
%N T(n,k)=Number of nXk 0..2 arrays with row sums and column sums unimodal
%C Table starts
%C ...3.......9.........22...........46............86...........148
%C ...9......81........564.........3298.........17048.........80412
%C ..22.....564......11264.......187103.......2719602......35688774
%C ..46....3298.....187103......8878492.....367772497...13710418065
%C ..86...17048....2719602....367772497...43541049634.4638776041518
%C .148...80412...35688774..13710418065.4638776041518
%C .239..353485..432076735.469842794992
%C .367.1469903.4902528769
%C .541.5845411
%C .771
%H R. H. Hardin, <a href="/A223892/b223892.txt">Table of n, a(n) for n = 1..60</a>
%e Some solutions for n=3 k=4
%e ..0..2..1..1....0..0..2..0....1..0..1..0....0..1..0..1....0..0..2..0
%e ..2..2..1..0....1..2..1..2....2..2..0..1....1..1..2..1....0..1..1..2
%e ..2..2..0..1....1..2..1..2....2..1..2..0....2..2..2..2....1..1..2..1
%Y Column 1 is A223718
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 28 2013