login
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 rowwise and columnwise
4

%I #5 Jan 12 2014 07:56:26

%S 256,2894,2894,28978,102188,28978,268448,3103656,3103656,268448,

%T 2377726,82875972,317142694,82875972,2377726,20374112,2014103692,

%U 28760293894,28760293894,2014103692,20374112,170668898,45287503606,2318212983882

%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 rowwise and columnwise

%C Table starts

%C ........256.........2894...........28978...........268448..........2377726

%C .......2894.......102188.........3103656.........82875972.......2014103692

%C ......28978......3103656.......317142694......28760293894....2318212983882

%C .....268448.....82875972.....28760293894....9569624142260.2861670695225974

%C ....2377726...2014103692...2318212983882.2861670695225974

%C ...20374112..45287503606.166487069932858

%C ..170668898.960171131904

%C .1404828230

%H R. H. Hardin, <a href="/A235577/b235577.txt">Table of n, a(n) for n = 1..40</a>

%F Empirical for column 1: [linear recurrence of order 17]

%e Some solutions for n=2 k=4

%e ..0..0..0..0..3....0..0..0..0..0....0..0..0..0..0....0..0..0..0..3

%e ..1..0..1..1..0....0..1..1..1..1....0..1..0..1..2....0..0..1..0..1

%e ..3..0..3..1..3....0..3..0..1..0....0..2..0..3..3....1..3..2..0..3

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Jan 12 2014