%I #5 Mar 31 2012 12:37:06
%S 256,1976,1976,15616,31848,15616,124048,516364,516364,124048,986388,
%T 8539884,17552984,8539884,986388,7854572,143559116,629784956,
%U 629784956,143559116,7854572,62623348,2448719840,23521828188,50678667832
%N T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock the same
%C Table starts
%C .......256.........1976............15616..............124048
%C ......1976........31848...........516364.............8539884
%C .....15616.......516364.........17552984...........629784956
%C ....124048......8539884........629784956.........50678667832
%C ....986388....143559116......23521828188.......4285363828968
%C ...7854572...2448719840.....902946068592.....371408707521176
%C ..62623348..42290474776...35270352008656...32556374834342020
%C .499915248.737993545372.1392432201867300.2868254295614429464
%H R. H. Hardin, <a href="/A205370/b205370.txt">Table of n, a(n) for n = 1..97</a>
%e Some solutions for n=4 k=3
%e ..2..1..3..2....0..3..2..1....1..1..2..0....0..0..1..0....3..1..0..0
%e ..0..1..1..2....1..0..3..2....2..1..2..2....2..0..0..0....1..0..2..1
%e ..0..1..2..2....2..1..0..3....2..1..2..1....0..0..1..0....2..1..3..2
%e ..0..1..1..2....1..3..2..0....1..1..2..0....1..0..1..3....3..2..0..3
%e ..0..0..1..1....1..0..3..2....3..1..2..2....3..0..1..3....0..3..1..0
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Jan 26 2012