|
%I #5 Mar 31 2012 12:36:35
%S 1,1,1,1,1,1,1,14,14,1,6,21,114,21,6,21,424,447,447,424,21,41,571,
%T 17598,11734,17598,571,41,36,14479,342958,341015,341015,342958,14479,
%U 36,281,18551,3366282,10692835,86954982,10692835,3366282,18551,281,1051,541753
%N T(n,k)=Number of nXk 0..3 arrays with values 0..3 introduced in row major order, the number of instances of each value within one of each other, and every element equal to zero or two horizontal or vertical neighbors
%C Table starts
%C ....1......1.........1...........1............6...........21...........41
%C ....1......1........14..........21..........424..........571........14479
%C ....1.....14.......114.........447........17598.......342958......3366282
%C ....1.....21.......447.......11734.......341015.....10692835....351517665
%C ....6....424.....17598......341015.....86954982...9746409872.533423159945
%C ...21....571....342958....10692835...9746409872.329877369234
%C ...41..14479...3366282...351517665.533423159945
%C ...36..18551..13445925.11945622271
%C ..281.541753.707828355
%C .1051.677755
%H R. H. Hardin, <a href="/A199201/b199201.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=6 k=4
%e ..0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1....0..1..0..1
%e ..1..0..1..2....1..0..2..3....1..0..1..2....1..0..2..3....1..0..2..0
%e ..2..3..2..1....3..2..3..2....0..3..2..0....0..2..3..2....2..2..3..1
%e ..3..2..3..0....2..0..2..1....1..2..3..1....2..1..2..3....2..2..0..3
%e ..0..3..0..1....0..1..3..0....2..3..2..3....3..0..3..0....1..3..3..1
%e ..3..2..3..2....2..3..1..3....3..2..3..0....1..3..2..1....2..3..3..0
%K nonn,tabl
%O 1,8
%A _R. H. Hardin_ Nov 03 2011
| 