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”).
%I #6 Jan 07 2015 15:20:03
%S 81,518,518,3550,3318,3550,23524,25062,25062,23524,157476,181308,
%T 241548,181308,157476,1051870,1284808,2113406,2113406,1284808,1051870,
%U 7027770,9172142,17719343,21509980,17719343,9172142,7027770,46953514,65613880
%N T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock diagonal maximum minus antidiagonal maximum unequal to its neighbors horizontally, vertically and nw-se diagonally
%C Table starts
%C .........81.........518.........3550..........23524..........157476
%C ........518........3318........25062.........181308.........1284808
%C .......3550.......25062.......241548........2113406........17719343
%C ......23524......181308......2113406.......21509980.......213776286
%C .....157476.....1284808.....17719343......213776286......2673402320
%C ....1051870.....9172142....152352910.....2149355346.....32368598122
%C ....7027770....65613880...1302707432....21597168872....395496194486
%C ...46953514...467877898..11094507660...212331840928...4770936979106
%C ..313711862..3342085566..94827318012..2118953225888..57860771981049
%C .2095963398.23863144636.808751503976.21018774727072.697085769177592
%H R. H. Hardin, <a href="/A253662/b253662.txt">Table of n, a(n) for n = 1..144</a>
%F Empirical for column k:
%F k=1: [linear recurrence of order 10] for n>11
%F k=2: [order 76] for n>80
%e Some solutions for n=2 k=4
%e ..0..1..0..0..0....2..0..2..0..2....0..1..2..0..1....1..1..0..1..0
%e ..0..0..0..2..0....2..0..0..2..1....1..2..0..0..2....1..0..2..1..2
%e ..0..0..2..1..2....1..0..2..1..0....2..0..2..2..0....2..1..0..2..2
%Y Column 1 is A253307
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 07 2015