login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with rows and columns in nondecreasing order and 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:56

%S 86,216,216,684,260,684,1714,1146,1146,1714,4434,2848,9483,2848,4434,

%T 10610,9945,40401,40401,9945,10610,24754,28434,235003,368326,235003,

%U 28434,24754,55451,87119,1025854,4086234,4086234,1025854,87119,55451

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

%C Table starts

%C .....86.....216.......684.......1714........4434.......10610.......24754

%C ....216.....260......1146.......2848........9945.......28434.......87119

%C ....684....1146......9483......40401......235003.....1025854.....4969133

%C ...1714....2848.....40401.....368326.....4086234....35402227...305194632

%C ...4434....9945....235003....4086234....91203410..1530840869.25951449861

%C ..10610...28434...1025854...35402227..1530840869.55632308352

%C ..24754...87119...4969133..305194632.25951449861

%C ..55451..254174..22190358.2367377082

%C .120398..732978.100488243

%C .253258.2062353

%H R. H. Hardin, <a href="/A184095/b184095.txt">Table of n, a(n) for n = 1..71</a>

%e Some solutions for 3X3

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

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

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

%e ...

%e ...6..6.......6..6.......4..5.......3..4.......6..6.......7..8.......9..10...

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Jan 09 2011