cp's OEIS Frontend

A205188 Number of (n+1) X 4 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.

%I A205188 #8 Jun 11 2018 04:17:58
%S A205188 48,64,124,160,292,384,708,928,1708,2240,4124,5408,9956,13056,24036,
%T A205188 31520,58028,76096,140092,183712,338212,443520,816516,1070752,1971244,
%U A205188 2585024,4759004,6240800,11489252,15066624,27737508,36374048,66964268
%N A205188 Number of (n+1) X 4 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.
%C A205188 Column 3 of A205193.
%H A205188 R. H. Hardin, <a href="/A205188/b205188.txt">Table of n, a(n) for n = 1..210</a>
%F A205188 Empirical: a(n) = 2*a(n-2) +a(n-4) for n>5.
%F A205188 Empirical g.f.: 4*x*(12 + 16*x + 7*x^2 + 8*x^3 - x^4) / (1 - 2*x^2 - x^4). - _Colin Barker_, Jun 11 2018
%e A205188 Some solutions for n=4:
%e A205188 ..1..0..0..1....1..1..1..0....0..0..1..0....0..1..0..0....1..0..0..1
%e A205188 ..0..1..1..0....1..1..0..1....0..0..0..1....0..0..1..1....1..0..0..0
%e A205188 ..0..1..1..0....1..0..1..1....1..0..0..1....0..0..1..1....0..1..0..0
%e A205188 ..1..0..0..1....0..1..1..1....0..1..1..0....0..1..0..0....0..0..1..0
%e A205188 ..0..0..0..0....0..1..1..0....1..1..1..1....1..0..0..0....0..0..0..1
%Y A205188 Cf. A205193.
%K A205188 nonn
%O A205188 1,1
%A A205188 _R. H. Hardin_, Jan 23 2012