|
%I #5 Mar 31 2012 12:37:33
%S 40,431,431,4615,13566,4615,49484,423694,423694,49484,530580,13288986,
%T 38415623,13288986,530580,5689274,416960476,3506487749,3506487749,
%U 416960476,5689274,61005068,13085817650,320128196268,934012605398
%N T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having one, two or three distinct clockwise edge differences
%C Table starts
%C ........40............431...............4615..................49484
%C .......431..........13566.............423694...............13288986
%C ......4615.........423694...........38415623.............3506487749
%C .....49484.......13288986.........3506487749...........934012605398
%C ....530580......416960476.......320128196268........248817068842201
%C ...5689274....13085817650.....29234187801911......66307681156504928
%C ..61005068...410707536246...2669774395715994...17671175952055398322
%C .654148428.12890620403588.243817307546400921.4709507638686926395711
%H R. H. Hardin, <a href="/A210355/b210355.txt">Table of n, a(n) for n = 1..144</a>
%e Some solutions for n=4 k=3
%e ..0..1..1..0....3..1..1..2....3..0..1..0....0..1..0..1....3..3..2..0
%e ..3..2..1..2....0..2..0..1....0..3..2..3....3..2..3..2....0..3..1..1
%e ..3..3..0..3....0..0..2..2....1..2..2..1....3..2..2..1....3..3..1..0
%e ..2..2..1..2....1..2..2..1....1..0..0..0....1..1..2..0....1..1..1..2
%e ..2..3..2..1....3..2..0..3....0..0..0..1....1..0..0..2....1..1..0..3
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Mar 20 2012
| 