Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #7 Dec 13 2015 21:30:37
%S 256,37408,22773384,51169273632,507960770486000
%N Number of (n+1) X (n+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.
%C Diagonal of A207799.
%e Some solutions for n=3:
%e ..1..2..1..2....0..2..0..1....1..1..3..2....2..0..3..0....2..0..3..1
%e ..3..0..1..2....2..1..0..0....0..3..3..0....0..2..2..1....1..2..2..3
%e ..1..1..3..2....0..1..1..2....1..0..2..1....0..3..2..0....0..2..0..3
%e ..2..1..0..1....0..0..2..1....1..2..2..0....1..0..2..2....2..2..1..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 20 2012