%I #4 Feb 06 2014 05:32:40
%S 256,1128,1128,5360,7544,5360,27376,56752,56752,27376,145488,471588,
%T 685244,471588,145488,802992,4167736,9292680,9292680,4167736,802992,
%U 4552384,38817072,134597244,205544096,134597244,38817072,4552384
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum minus the upper median minus the lower median of every 2X2 subblock equal
%C Table starts
%C .......256.........1128............5360.............27376...............145488
%C ......1128.........7544...........56752............471588..............4167736
%C ......5360........56752..........685244...........9292680............134597244
%C .....27376.......471588.........9292680.........205544096...........4821666340
%C ....145488......4167736.......134597244........4821666340.........181211467948
%C ....802992.....38817072......2051387740......118567856892........7117073796344
%C ...4552384....375021656.....32420171928.....3028672538964......291062464483036
%C ..26458368...3729166264....527547020504....80031975760432....12383494364753228
%C .156639808..37856371660...8787002245648..2178875438380620...546793895792910920
%C .942349824.390487433404.149199162038628.60875277529034968.24967144157622737956
%H R. H. Hardin, <a href="/A237299/b237299.txt">Table of n, a(n) for n = 1..111</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 21]
%F k=2: [order 53]
%e Some solutions for n=2 k=4
%e ..0..0..3..0..1....0..2..2..1..2....0..2..0..1..1....0..1..3..2..1
%e ..2..2..1..2..1....1..1..3..2..1....2..0..2..1..1....2..0..1..1..1
%e ..0..0..3..2..1....2..2..2..1..0....1..3..1..2..2....3..0..0..3..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 06 2014
|