login
T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the minimum of its diagonal elements greater than the absolute difference of its antidiagonal elements
8

%I #4 Dec 02 2014 17:58:02

%S 192,2312,2312,27486,86930,27486,327033,3204536,3204536,327033,

%T 3888017,119053429,360591824,119053429,3888017,46227589,4414109389,

%U 41060404870,41060404870,4414109389,46227589,549607078,163787201307,4653177899915

%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the minimum of its diagonal elements greater than the absolute difference of its antidiagonal elements

%C Table starts

%C .....192.......2312.........27486...........327033.............3888017

%C ....2312......86930.......3204536........119053429..........4414109389

%C ...27486....3204536.....360591824......41060404870.......4653177899915

%C ..327033..119053429...41060404870...14434973166138....5038742133151250

%C .3888017.4414109389.4653177899915.5038742133151250.5400094007696295470

%H R. H. Hardin, <a href="/A251442/b251442.txt">Table of n, a(n) for n = 1..112</a>

%F Empirical for column k:

%F k=1: [linear recurrence of order 10]

%F k=2: [order 41]

%e Some solutions for n=2 k=4

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

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

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

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_, Dec 02 2014