|
%I #5 Mar 31 2012 12:37:06
%S 256,34792,22414008,69248994984,1002427910938748,68862365329186909360
%N Number of (n+1)X(n+1) 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor
%C Diagonal of A205466
%e Some solutions for n=4
%e ..0..3..3..0..1....1..1..3..3..0....0..3..2..1..0....2..0..3..1..1
%e ..0..1..0..0..2....3..1..0..3..2....2..2..3..0..1....2..1..1..2..0
%e ..1..2..0..0..0....1..2..2..0..0....1..3..3..1..1....3..3..2..2..1
%e ..0..3..1..3..1....2..2..2..0..0....1..3..3..0..2....1..0..0..3..0
%e ..1..0..0..1..1....2..2..3..2..0....3..0..1..1..1....3..3..1..1..3
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 27 2012
| 