Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #10 Jun 25 2018 15:54:56
%S 256,2208,20800,184416,1714176,15376544,141647296,1279043040,
%T 11724000896,106260735008,971279945280,8821770053472,80508174426368,
%U 732094567369632,6675191873895104,60741010476989664,553553902058209152
%N Number of (n+1) X 2 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.
%C Column 1 of A207799.
%H R. H. Hardin, <a href="/A207792/b207792.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = a(n-1) + 61*a(n-2) + 83*a(n-3) + 272*a(n-4) + 336*a(n-5).
%F Empirical g.f.: 32*x*(8 + 61*x + 93*x^2 + 240*x^3 + 252*x^4) / (1 - x - 61*x^2 - 83*x^3 - 272*x^4 - 336*x^5). - _Colin Barker_, Jun 25 2018
%e Some solutions for n=4:
%e ..2..0....3..0....1..0....3..3....0..1....2..0....2..1....2..0....1..0....1..3
%e ..1..0....2..0....0..0....0..1....0..0....2..2....2..3....2..2....0..3....2..1
%e ..0..0....3..1....1..2....2..3....1..2....1..3....0..1....1..0....0..1....2..0
%e ..1..2....2..1....2..1....2..0....3..0....0..1....2..1....3..2....1..1....3..2
%e ..1..1....3..2....0..1....1..1....1..1....2..2....0..2....3..0....2..3....3..0
%Y Cf. A207799.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 20 2012