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 Jan 16 2014 06:44:44
%S 256,2894,2894,28978,87888,28978,268448,2287822,2273170,268448,
%T 2377726,52447112,153490516,52510194,2377726,20374112,1113883030,
%U 8998042696,9225012664,1128547722,20374112,170668898,22196597522,482216047328
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the difference of the upper and lower median value of each 2X2 subblock in lexicographically nondecreasing order columnwise and nonincreasing rowwise
%C Table starts
%C ........256.........2894..........28978..........268448.........2377726
%C .......2894........87888........2287822........52447112......1113883030
%C ......28978......2273170......153490516......8998042696....482216047328
%C .....268448.....52510194.....9225012664...1441675265430.209596416266780
%C ....2377726...1128547722...513135357020.220346049497754
%C ...20374112..22902973310.26782783497172
%C ..170668898.445722551604
%C .1404828230
%H R. H. Hardin, <a href="/A235818/b235818.txt">Table of n, a(n) for n = 1..40</a>
%e Some solutions for n=2 k=4
%e ..0..0..1..0..1....2..0..0..1..1....2..0..0..1..0....2..0..0..1..0
%e ..0..2..3..0..1....0..1..1..0..0....2..2..1..0..1....0..1..2..0..1
%e ..2..2..1..2..3....1..1..0..0..0....3..1..1..2..2....3..1..0..1..0
%Y Column 1 and row 1 are A235574
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 16 2014