|
%I #7 Dec 10 2015 02:04:20
%S 256,1776,1776,12712,11028,12712,91440,81864,81864,91440,656272,
%T 620988,754704,620988,656272,4711264,4601832,6705048,6705048,4601832,
%U 4711264,33827496,34647764,59081744,70027468,59081744,34647764,33827496
%N T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.
%C Table starts
%C .......256.......1776.......12712........91440.........656272.........4711264
%C ......1776......11028.......81864.......620988........4601832........34647764
%C .....12712......81864......754704......6705048.......59081744.......519841120
%C .....91440.....620988.....6705048.....70027468......692354440......6909160028
%C ....656272....4601832....59081744....692354440.....8605131924....103395482496
%C ...4711264...34647764...519841120...6909160028...103395482496...1498787263308
%C ..33827496..258956760..4654724592..72541287824..1315300941940..22850275822056
%C .242859696.1942182832.41664657416.778680028616.16790996352160.350243656458156
%H R. H. Hardin, <a href="/A205944/b205944.txt">Table of n, a(n) for n = 1..112</a>
%e Some solutions for n=4, k=3:
%e ..2..0..0..1....3..2..2..0....0..3..3..3....0..1..0..0....0..2..1..0
%e ..3..0..2..0....2..2..2..1....2..3..1..0....1..2..3..0....1..0..0..0
%e ..3..3..0..0....2..2..0..2....2..3..2..1....0..3..2..1....1..2..2..1
%e ..3..3..0..0....1..1..2..2....1..1..0..1....1..0..1..3....1..1..3..2
%e ..2..2..2..1....1..1..1..0....1..1..3..2....1..1..2..2....3..2..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 01 2012
| 