login
Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.
0

%I #6 Oct 06 2015 21:41:58

%S 141647296,56368726448,30836924266632,16680713033508736,

%T 9906634826573197984

%N Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.

%C Column 7 of A207799.

%e Some solutions for n=4:

%e ..3..3..0..0..1..3..3..0....0..1..3..0..2..3..2..1....2..0..2..2..1..0..3..2

%e ..1..2..3..1..0..0..3..1....0..3..3..1..0..3..2..3....2..0..3..3..3..0..1..2

%e ..0..1..3..1..2..0..2..3....3..2..0..2..2..1..1..0....3..3..0..1..2..1..0..3

%e ..3..1..3..0..3..3..0..3....3..0..3..2..2..3..3..3....1..3..1..0..3..1..3..2

%e ..0..2..3..0..1..1..0..3....2..1..3..3..0..1..2..2....0..0..2..3..3..0..1..1

%K nonn

%O 1,1

%A _R. H. Hardin_ Feb 20 2012