|
%I #5 Mar 31 2012 12:37:29
%S 7,20,20,61,105,61,191,562,562,191,603,3051,5075,3051,603,1909,16582,
%T 46515,46515,16582,1909,6049,90186,425803,723636,425803,90186,6049,
%U 19173,490547,3901194,11226644,11226644,3901194,490547,19173,60777,2668340
%N T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences
%C Table starts
%C .....7......20........61.........191...........603............1909
%C ....20.....105.......562........3051.........16582...........90186
%C ....61.....562......5075.......46515........425803.........3901194
%C ...191....3051.....46515......723636......11226644.......174401424
%C ...603...16582....425803....11226644.....294738262......7751834609
%C ..1909...90186...3901194...174401424....7751834609....345350598642
%C ..6049..490547..35741496..2708892873..203828058161..15380031974285
%C .19173.2668340.327471411.42079740150.5360172454106.685056630399243
%H R. H. Hardin, <a href="/A209553/b209553.txt">Table of n, a(n) for n = 1..364</a>
%e Some solutions for n=4 k=3
%e ..0..2..0..2....0..3..2..3....3..2..3..0....1..0..3..0....0..1..2..1
%e ..2..0..2..0....1..2..3..2....2..3..2..1....2..3..0..3....3..2..1..0
%e ..0..2..0..2....2..1..2..1....1..0..1..2....1..2..1..2....0..1..2..1
%e ..2..0..2..0....3..0..1..0....0..1..2..1....2..1..0..3....3..2..3..0
%e ..0..2..0..2....2..1..2..1....3..2..3..2....1..2..3..0....0..1..2..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 10 2012
| 