|
%I #4 Jan 12 2014 08:48:29
%S 256,2896,2896,29902,100653,29902,283672,3187679,3187679,283672,
%T 2573798,88558785,344369103,88558785,2573798,22515040,2266703217,
%U 32581688349,32581688349,2266703217,22515040,192101098,53743314489,2793785197645
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the difference of the upper median and minimum value of each 2X2 subblock in lexicographically nondecreasing order rowwise and columnwise
%C Table starts
%C ........256..........2896...........29902...........283672..........2573798
%C .......2896........100653.........3187679.........88558785.......2266703217
%C ......29902.......3187679.......344369103......32581688349....2793785197645
%C .....283672......88558785.....32581688349...11225929365891.3554451567473769
%C ....2573798....2266703217...2793785197645.3554451567473769
%C ...22515040...53743314489.214261916260111
%C ..192101098.1204872525582
%C .1606970816
%H R. H. Hardin, <a href="/A235582/b235582.txt">Table of n, a(n) for n = 1..40</a>
%F Empirical for column 1: [linear recurrence of order 29]
%e Some solutions for n=2 k=4
%e ..0..0..1..1..2....0..0..1..1..3....0..0..0..3..2....0..0..0..3..2
%e ..0..0..0..1..0....0..0..0..1..0....0..0..1..1..2....0..0..0..1..2
%e ..0..0..1..0..3....0..1..1..3..1....0..0..3..2..2....0..0..0..2..3
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 12 2014
| 