login
T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum
7

%I #5 Mar 31 2012 12:36:02

%S 0,99,99,163,697,163,1107,4451,4451,1107,2887,30775,41643,30775,2887,

%T 13347,207705,511253,511253,207705,13347,43105,1418183,5616321,

%U 10355969,5616321,1418183,43105,174081,9658679,64545575,195165583,195165583

%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal sum less antidiagonal sum equal to some horizontal or vertical neighbor 2X2 subblock diagonal sum less antidiagonal sum

%C Table starts

%C .......0........99........163........1107.........2887........13347.......43105

%C ......99.......697.......4451.......30775.......207705......1418183.....9658679

%C .....163......4451......41643......511253......5616321.....64545575...727129819

%C ....1107.....30775.....511253....10355969....195165583...3784477987.72577946431

%C ....2887....207705....5616321...195165583...6164545679.201869155765

%C ...13347...1418183...64545575..3784477987.201869155765

%C ...43105...9658679..727129819.72577946431

%C ..174081..65903901.8283584625

%C ..613897.449371311

%C .2364597

%H R. H. Hardin, <a href="/A185504/b185504.txt">Table of n, a(n) for n = 1..59</a>

%e Some solutions for 4X3

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

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

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

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

%K nonn,tabl

%O 1,2

%A _R. H. Hardin_ Jan 29 2011