|
%I #6 Dec 13 2015 21:29:22
%S 114566336,222273709440,449274384195312,920635927293402816,
%T 1897470427514439403464,3920972890172486310882016
%N Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an equal number of clockwise and counterclockwise edge increases.
%C Column 7 of A206752.
%e Some solutions for n=4:
%e ..1..2..1..1..0..2..0..3....1..0..0..0..0..3..1..2....0..3..1..2..1..1..1..2
%e ..0..1..1..2..1..3..1..0....1..0..1..0..1..0..3..1....2..0..3..0..3..1..0..1
%e ..1..0..1..2..1..1..0..0....1..0..0..1..0..0..3..1....2..0..3..3..1..2..1..3
%e ..1..0..0..1..1..1..0..0....0..1..1..3..1..0..3..1....1..3..1..1..0..1..0..2
%e ..3..1..0..0..1..0..1..0....1..3..3..1..1..1..0..3....1..3..3..3..1..2..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 12 2012
| 