A205915 - OEIS

%I #7 Dec 10 2015 02:17:13

%S 218034,2554848,93488811,3820547082,157611325827,6566654061039,

%T 274342874332980,11488530154756449,481501347104927403,

%U 20193219305106753600,847089560605594813119,35541367887133558923699

%N Number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and the same number of counterclockwise edge increases as its vertical neighbors.

%C Column 6 of A205917.

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

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 01 2012