|
%I #7 Dec 11 2015 21:28:56
%S 124048,2410188,95187756,5674969344,364197868292,23825180259760,
%T 1565902419680820,103072965502712948,6787839598041328144,
%U 447082947814419915320,29448832580439035349148,1939795939085668889831840
%N Number of (n+1) X 5 0..3 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 4 of A206188.
%H R. H. Hardin, <a href="/A206184/b206184.txt">Table of n, a(n) for n = 1..190</a>
%e Some solutions for n=4:
%e ..0..0..1..0..3....1..3..1..0..0....1..0..0..0..0....1..3..2..3..0
%e ..2..0..0..0..2....3..3..1..3..3....3..3..3..3..3....1..1..2..3..3
%e ..2..0..1..1..1....1..1..1..2..2....0..1..3..0..0....3..2..1..1..0
%e ..2..0..1..2..3....0..3..2..0..3....1..0..3..2..1....2..2..0..0..0
%e ..1..0..3..3..2....3..3..2..3..3....3..3..3..2..1....1..2..3..3..0
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 04 2012
| 