login
Number of (n+1) X 7 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.
1

%I #7 Dec 12 2015 17:49:15

%S 77580,123357,437340,1824315,8405508,39044748,167821686,751671621,

%T 3186738756,14344492080,63040672158,293272589487,1300384478688,

%U 6029134019499,26776062237576,124337331861300,551531622746376

%N Number of (n+1) X 7 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.

%C Column 6 of A206277.

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

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 05 2012