%I #7 Apr 24 2021 09:28:17
%S 1,1,1,1,6,1,6,15,15,6,15,148,110,148,15,15,739,1114,1114,739,15,90,
%T 1538,10790,55956,10790,1538,90,226,19458,108608,1167274,1167274,
%U 108608,19458,226,219,99290,1114424,9196334,49412210,9196334,1114424,99290,219,1436
%N T(n,k) = Number of n X k 0..2 arrays with values 0..2 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or one horizontal or vertical neighbors.
%C Table starts
%C ....1.......1..........1...........6............15............15............90
%C ....1.......6.........15.........148...........739..........1538.........19458
%C ....1......15........110........1114.........10790........108608.......1114424
%C ....6.....148.......1114.......55956.......1167274.......9196334.....530601540
%C ...15.....739......10790.....1167274......49412210.....792389959...96560931821
%C ...15....1538.....108608.....9196334.....792389959...70698654245.6443389324257
%C ...90...19458....1114424...530601540...96560931821.6443389324257
%C ..226...99290...11614563.11633434848.4344228334421
%C ..219..199245..122555420.92326218546
%C .1436.2737170.1306096140
%H R. H. Hardin, <a href="/A199230/b199230.txt">Table of n, a(n) for n = 1..84</a>
%e Some solutions for n=6, k=4
%e ..0..1..0..0....0..1..0..0....0..1..0..0....0..1..0..0....0..1..0..0
%e ..1..2..1..2....2..0..1..2....2..0..1..1....2..0..1..1....1..0..1..2
%e ..1..2..0..1....1..2..0..1....2..1..0..2....1..2..0..2....2..1..0..2
%e ..2..1..0..1....1..2..1..2....0..2..0..2....2..1..2..1....1..2..1..0
%e ..2..0..1..2....0..0..2..1....2..1..2..1....2..0..2..0....1..2..0..2
%e ..0..2..0..2....2..1..2..0....1..2..1..0....0..2..1..1....2..0..2..1
%K nonn,tabl
%O 1,5
%A _R. H. Hardin_ Nov 04 2011