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 Feb 13 2014 06:51:57
%S 6640,122260,122260,4995424,33108928,4995424,102708184,1971669364,
%T 1971669364,102708184,3094685248,518886911776,2405641138384,
%U 518886911776,3094685248,66258357796,28826088968548,924622251445704,924622251445704
%N T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with the (lower) medians of each row equal and of each column equal
%C Table starts
%C ........6640.........122260.........4995424.......102708184.........3094685248
%C ......122260.......33108928......1971669364....518886911776.....28826088968548
%C .....4995424.....1971669364...2405641138384.924622251445704.724045977072915424
%C ...102708184...518886911776.924622251445704
%C ..3094685248.28826088968548
%C .66258357796
%H R. H. Hardin, <a href="/A237794/b237794.txt">Table of n, a(n) for n = 1..24</a>
%e Some solutions for n=1 k=4
%e ..0..0..0..0..1..0....0..0..0..0..0..0....0..0..1..1..3..3....0..0..0..3..3..0
%e ..1..0..0..3..0..3....0..0..2..1..0..0....1..1..1..2..0..1....0..1..1..0..0..0
%e ..0..0..1..0..0..0....0..1..0..0..1..2....1..1..1..0..1..0....1..0..0..0..0..3
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 13 2014