|
%I #4 Jan 12 2014 06:18:13
%S 256,2612,2612,23024,86742,23024,180640,2481481,2481481,180640,
%T 1321956,58495571,269127070,58495571,1321956,9182760,1190247008,
%U 24006644081,24006644081,1190247008,9182760,61590128,21374536916,1779283912244
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of each 2X2 subblock two extreme terms minus its two median terms lexicographically nondecreasing rowwise and columnwise
%C Table starts
%C ......256........2612.........23024........180640.......1321956.........9182760
%C .....2612.......86742.......2481481......58495571....1190247008.....21374536916
%C ....23024.....2481481.....269127070...24006644081.1779283912244.111365596706324
%C ...180640....58495571...24006644081.8553264090329
%C ..1321956..1190247008.1779283912244
%C ..9182760.21374536916
%C .61590128
%H R. H. Hardin, <a href="/A235559/b235559.txt">Table of n, a(n) for n = 1..31</a>
%F Empirical for column 1: [linear recurrence of order 38]
%e Some solutions for n=2 k=4
%e ..0..0..1..0..2....0..0..2..1..0....0..0..2..1..3....0..0..0..0..3
%e ..0..0..2..0..1....0..0..2..1..3....0..0..3..1..1....0..0..1..0..0
%e ..1..2..1..0..0....0..0..2..1..0....1..3..2..0..1....2..1..0..0..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 12 2014
| 