|
%I #5 Mar 31 2012 12:37:09
%S 256,3036,3036,32208,95888,32208,319784,2554260,2554260,319784,
%T 3048544,61330824,164649752,61330824,3048544,28259556,1380479280,
%U 9355289120,9355289120,1380479280,28259556,256692580,29707151720,490921163308
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in 2X2 subblocks nondecreasing rightwards and downwards
%C Table starts
%C ........256...........3036.............32208................319784
%C .......3036..........95888...........2554260..............61330824
%C ......32208........2554260.........164649752............9355289120
%C .....319784.......61330824........9355289120.........1235093642064
%C ....3048544.....1380479280......490921163308.......148812223113936
%C ...28259556....29707151720....24368030395844.....16821962566961468
%C ..256692580...618727630440..1161408617136336...1815101219263424368
%C .2295975140.12572031551824.53673997085581436.189063838791570094396
%H R. H. Hardin, <a href="/A205935/b205935.txt">Table of n, a(n) for n = 1..71</a>
%e Some solutions for n=4 k=3
%e ..0..2..2..1....0..3..2..1....0..1..2..1....0..1..2..3....1..0..1..0
%e ..1..0..3..2....1..0..3..2....1..1..0..2....2..2..0..2....0..0..1..2
%e ..2..1..0..3....2..1..0..3....1..3..1..3....1..0..1..3....0..3..3..0
%e ..0..3..1..0....1..3..2..0....2..0..2..0....2..1..2..0....1..1..0..1
%e ..1..0..2..1....1..0..3..2....1..2..0..1....0..3..1..0....1..0..1..2
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Feb 01 2012
| 