%I #7 Jan 16 2022 00:25:15
%S 423,3642,32106,284910,2531223,22488006,199775148,1774684842,
%T 15765175170,140047755324,1244095016967,11051748079860,98176695538581,
%U 872139276184362,7747530234577809,68824127481596856,611389743559128132
%N Number of (n+1) X 4 0..2 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to two.
%C Column 3 of A205836.
%H R. H. Hardin, <a href="/A205831/b205831.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 14*a(n-1) -56*a(n-2) +103*a(n-3) -85*a(n-4) +23*a(n-5) -19*a(n-6) -16*a(n-7) +a(n-8) -a(n-9).
%e Some solutions for n=4
%e ..2..0..2..2....2..0..0..1....0..0..2..1....0..0..1..0....1..1..2..2
%e ..0..2..1..0....1..2..1..2....2..1..0..2....2..1..2..1....0..2..1..0
%e ..1..0..2..1....2..1..0..1....0..2..1..0....1..2..0..2....1..0..2..1
%e ..2..1..0..2....1..0..1..2....1..0..2..1....1..0..1..0....2..1..0..2
%e ..0..2..1..0....0..1..0..0....0..1..0..2....2..1..2..1....0..2..1..0
%Y Cf. A205836.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 01 2012