login
Number of (n+1) X 7 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.
1

%I #9 Dec 31 2023 15:53:57

%S 11948296,9597910280,7932164084608,6623652903138136,

%T 5553852092522802280,4664832940178290442768,3920972889443714995894776,

%U 3296755941450923874944187224,2772285061723585066493554850800

%N Number of (n+1) X 7 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.

%C Column 6 of A208492.

%H R. H. Hardin, <a href="/A208490/b208490.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=4:

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

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

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

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

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

%Y Cf. A208492.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 27 2012