|
%I #11 Dec 13 2015 21:30:12
%S 256,1888,1888,15680,36384,15680,139744,793152,793152,139744,1289472,
%T 18037344,43894936,18037344,1289472,12105120,415429504,2475217568,
%U 2475217568,415429504,12105120,114566336,9604042208,140074119984
%N T(n,k) = number of (n+1) X (k+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.
%C Table starts:
%C ........256..........1888.............15680................139744
%C .......1888.........36384............793152..............18037344
%C ......15680........793152..........43894936............2475217568
%C .....139744......18037344........2475217568..........343128343904
%C ....1289472.....415429504......140074119984........47661729160320
%C ...12105120....9604042208.....7932406245672......6623662914493232
%C ..114566336..222273709440...449274384195312....920635927293402816
%C .1088409696.5145902199776.25446640113989392.127966527042768090112
%H R. H. Hardin, <a href="/A206752/b206752.txt">Table of n, a(n) for n = 1..84</a>
%e Some solutions for n=4, k=3:
%e ..1..3..2..2....3..2..2..0....0..0..1..0....1..0..0..0....2..3..3..0
%e ..0..2..2..1....1..3..2..0....0..1..1..0....0..3..3..3....0..2..2..3
%e ..1..0..2..1....1..3..2..2....3..0..0..1....1..0..3..3....2..0..2..2
%e ..2..1..3..2....1..1..3..2....1..3..3..0....1..0..3..1....2..0..2..2
%e ..0..3..0..3....3..3..1..3....1..1..1..3....1..0..0..2....1..3..0..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_, Feb 12 2012
| 