%I #4 Mar 07 2013 09:52:28
%S 1,1,1,2,7,2,10,51,51,10,24,391,737,391,24,72,2894,19446,19446,2894,
%T 72,168,22491,292257,1020085,292257,22491,168,664,173099,7998180,
%U 54792022,54792022,7998180,173099,664,1632,1351439,124148448,2987881000
%N T(n,k)=Number of nXk 0..2 arrays with no more than floor(nXk/2) elements equal to at least one horizontal or vertical neighbor, with new values introduced in row major 0..2 order
%C Table starts
%C .....1........1...........2............10..............24..............72
%C .....1........7..........51...........391............2894...........22491
%C .....2.......51.........737.........19446..........292257.........7998180
%C ....10......391.......19446.......1020085........54792022......2987881000
%C ....24.....2894......292257......54792022......5837726398...1141704766670
%C ....72....22491.....7998180....2987881000...1141704766670.443127930756205
%C ...168...173099...124148448..164730750373.124856316713527
%C ...664..1351439..3439829096.9157731030542
%C ..1632.10562301.54306296841
%C ..5376.83067164
%C .13152
%H R. H. Hardin, <a href="/A222853/b222853.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=3 k=4
%e ..0..1..0..1....0..1..0..2....0..0..0..1....0..1..0..1....0..1..2..0
%e ..0..0..1..0....2..2..1..0....1..0..1..0....1..2..2..2....1..0..1..0
%e ..1..2..1..1....2..1..2..0....2..0..0..2....0..0..2..0....1..1..2..1
%K nonn,tabl
%O 1,4
%A _R. H. Hardin_ Mar 07 2013