login
T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one
10

%I #5 Mar 31 2012 12:35:55

%S 81,459,459,2601,4401,2601,15759,43163,43163,15759,95481,459821,

%T 746017,459821,95481,586791,4911675,14219749,14219749,4911675,586791,

%U 3606201,53575889,272110811,492135291,272110811,53575889,3606201,22235391

%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no 2X2 subblock sum differing from a horizontal or vertical neighbor subblock sum by more than one

%C Table starts

%C ........81.........459..........2601..........15759..........95481

%C .......459........4401.........43163.........459821........4911675

%C ......2601.......43163........746017.......14219749......272110811

%C .....15759......459821......14219749......492135291....17133244697

%C .....95481.....4911675.....272110811....17133244697..1088246684231

%C ....586791....53575889....5344196941...615149254565.71600778588343

%C ...3606201...584520435..105022040225.22112885527475

%C ..22235391..6415409881.2080498882227

%C .137100681.70404186587

%C .845893287

%H R. H. Hardin, <a href="/A183971/b183971.txt">Table of n, a(n) for n = 1..60</a>

%e Some solutions for 3X3

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

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

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

%e ...

%e ...6..5.......2..2.......6..6.......3..3.......4..4.......5..5.......5..4...

%e ...6..6.......2..1.......5..6.......3..3.......3..3.......5..4.......6..5...

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Jan 08 2011