|
%I #7 Dec 12 2015 17:49:49
%S 309057,408198,1528920,6254364,33297948,167821686,964315869,
%T 4586324364,22656222912,107944182948,562553467470,2820402520110,
%U 14881797312963,75177032639256,401169616195323,2040321270376866,10870614344272152
%N Number of (n+1) X 8 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 7 of A206277.
%H R. H. Hardin, <a href="/A206276/b206276.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4:
%e ..0..0..2..2..0..0..2..1....0..2..2..2..1..2..2..1....1..2..2..1..2..0..0..1
%e ..1..1..0..0..2..2..0..0....0..2..2..0..2..2..2..1....0..2..2..2..0..0..0..1
%e ..1..1..0..0..2..2..0..0....2..0..0..2..2..2..0..2....2..0..2..2..0..0..1..2
%e ..0..0..1..1..0..0..1..1....0..0..0..2..2..1..2..2....2..2..0..0..1..1..2..2
%e ..0..0..1..1..0..0..1..1....0..0..1..0..0..2..2..2....2..2..0..0..1..1..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 05 2012
| 