%I #5 Mar 31 2012 12:37:32
%S 112,1578,1578,22212,78628,22212,312704,3913002,3913002,312704,
%T 4402192,194768054,688122928,194768054,4402192,61973516,9694276684,
%U 121040117840,121040117840,9694276684,61973516,872455004,482519042626,21290108702694
%N T(n,k)=Half the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference
%C Table starts
%C .........112.............1578.................22212.....................312704
%C ........1578............78628...............3913002..................194768054
%C .......22212..........3913002.............688122928...............121040117840
%C ......312704........194768054..........121040117840.............75244563204398
%C .....4402192.......9694276684........21290108702694..........46773822117508382
%C ....61973516.....482519042626......3744799069935140.......29075895528477825602
%C ...872455004...24016699289368....658686645074030420....18074362569780907584746
%C .12282307884.1195397128587610.115858857345804835112.11235513600375237582792174
%H R. H. Hardin, <a href="/A210300/b210300.txt">Table of n, a(n) for n = 1..144</a>
%e Some solutions for n=4 k=3
%e ..0..3..3..3....2..1..1..0....1..2..3..2....1..0..0..0....1..1..0..0
%e ..2..1..0..1....3..3..0..2....3..1..1..1....0..3..1..2....3..1..3..0
%e ..0..1..1..1....0..0..0..2....3..3..3..1....1..0..1..3....1..0..1..3
%e ..3..3..1..2....3..1..1..2....3..1..3..3....1..3..3..2....2..0..1..3
%e ..3..0..0..0....0..1..0..0....3..1..1..1....1..3..0..2....2..2..1..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 19 2012
|