|
%I #8 Oct 09 2015 04:25:41
%S 256,2320,2320,21416,28724,21416,198688,377568,377568,198688,1843744,
%T 5079336,8381936,5079336,1843744,17111320,69574220,211610280,
%U 211610280,69574220,17111320,158804736,962953968,5747728044,11786800328,5747728044
%N T(n,k) = Number of (n+1)X(k+1) 0..3 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.
%C Table starts
%C ........256.........2320...........21416.............198688
%C .......2320........28724..........377568............5079336
%C ......21416.......377568.........8381936..........211610280
%C .....198688......5079336.......211610280........11786800328
%C ....1843744.....69574220......5747728044.......727845846776
%C ...17111320....962953968....163624211124.....46738310925116
%C ..158804736..13444055224...4782966551464...3046981775525932
%C .1473828208.188823193784.141848199078560.199800076245538628
%H R. H. Hardin, <a href="/A205642/b205642.txt">Table of n, a(n) for n = 1..111</a>
%e Some solutions for n=4, k=3:
%e ..3..3..1..3....1..1..3..2....1..0..3..3....2..2..1..1....3..0..1..1
%e ..1..0..0..3....2..3..2..0....0..0..3..0....2..0..0..2....2..0..0..0
%e ..1..2..1..1....3..1..3..1....3..3..3..0....2..3..2..2....2..0..2..0
%e ..3..2..3..2....2..3..2..3....2..2..3..0....0..3..3..2....2..0..0..0
%e ..0..2..0..0....1..2..3..2....0..2..3..3....3..3..0..0....2..0..3..3
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Jan 29 2012
| 