cp's OEIS Frontend

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

%I A205192 #8 Jun 11 2018 04:18:33
%S A205192 432,440,708,864,1568,2048,3904,4608,7872,9216,15808,18944,32960,
%T A205192 39936,69824,84480,147520,178176,310848,375296,654656,790528,1379136,
%U A205192 1665536,2905792,3509248,6122432,7393792,12899520,15578112,27178176,32821760
%N A205192 Number of (n+1) X 8 0..1 arrays with the number of clockwise edge increases in every 2 X 2 subblock differing from each horizontal or vertical neighbor.
%C A205192 Column 7 of A205193.
%H A205192 R. H. Hardin, <a href="/A205192/b205192.txt">Table of n, a(n) for n = 1..210</a>
%F A205192 Empirical: a(n) = 2*a(n-2) +a(n-8) for n>13.
%F A205192 Empirical g.f.: 4*x*(108 + 110*x - 39*x^2 - 4*x^3 + 38*x^4 + 80*x^5 + 192*x^6 + 128*x^7 - 92*x^8 - 110*x^9 - 161*x^10 - 88*x^11 - 56*x^12) / (1 - 2*x^2 - x^8). - _Colin Barker_, Jun 11 2018
%e A205192 Some solutions for n=4:
%e A205192 ..0..0..1..1..0..0..1..1....1..0..0..1..0..0..1..1....1..0..0..1..1..0..0..1
%e A205192 ..1..1..0..0..1..1..0..0....0..1..1..0..0..0..1..1....0..1..1..0..0..1..1..0
%e A205192 ..1..1..0..0..1..1..0..0....0..1..1..0..0..1..0..0....1..1..1..0..0..1..1..0
%e A205192 ..1..0..1..1..0..0..1..1....1..0..0..1..1..0..0..0....1..1..0..1..1..0..0..1
%e A205192 ..0..1..1..1..0..0..1..1....0..0..0..1..1..0..0..1....0..0..1..1..1..0..0..0
%Y A205192 Cf. A205193.
%K A205192 nonn
%O A205192 1,1
%A A205192 _R. H. Hardin_, Jan 23 2012