|
%I #7 Dec 10 2015 01:56:42
%S 104,680,680,4440,7688,4440,29000,87448,87448,29000,189400,996840,
%T 1763560,996840,189400,1237000,11364568,35846696,35846696,11364568,
%U 1237000,8079000,129573608,729589784,1312173688,729589784,129573608
%N T(n,k) = number of (n+1) X (k+1) 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock unequal to the number of counterclockwise edge increases.
%C Table starts
%C ......104.........680..........4440............29000.............189400
%C ......680........7688.........87448...........996840...........11364568
%C .....4440.......87448.......1763560.........35846696..........729589784
%C ....29000......996840......35846696.......1312173688........48253100168
%C ...189400....11364568.....729589784......48253100168......3222294559864
%C ..1237000...129573608...14856355384....1777528400280....216074701653640
%C ..8079000..1477339224..302535915752...65511284596104..14510530142894840
%C .52765000.16844007528.6161045831496.2414878151153112.975067532289817432
%H R. H. Hardin, <a href="/A206021/b206021.txt">Table of n, a(n) for n = 1..144</a>
%e Some solutions for n=3, k=3:
%e ..1..1..3..3....2..2..3..0....1..1..3..2....1..2..2..1....3..0..1..0
%e ..3..2..2..0....3..0..3..1....0..2..3..0....0..0..3..0....1..0..2..2
%e ..3..0..1..1....3..1..2..1....1..1..3..2....1..2..2..0....1..3..3..0
%e ..1..0..2..3....0..1..0..1....2..0..0..1....3..3..1..0....0..0..2..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 02 2012
| 