Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Jan 20 2024 18:34:00
%S 205416,165936,240192,1645920,8613504,56633472,408445632,2199502080,
%T 14566314240,105251128704,567471536640,3758109073920,27154791205632,
%U 146407656453120,969592141071360,7005936131053056,37773175364904960
%N Number of (n+1) X 8 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases.
%C Column 7 of A206094.
%H R. H. Hardin, <a href="/A206093/b206093.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 258*a(n-3) for n>10.
%e Some solutions for n=4:
%e ..1..2..2..0..1..1..2..0....2..0..0..1..2..2..0..0....0..1..2..0..1..1..2..0
%e ..0..1..2..2..0..1..1..2....0..0..1..2..2..0..1..1....1..1..2..2..0..1..1..2
%e ..0..0..1..2..2..0..1..1....0..1..2..2..0..1..1..0....2..2..1..2..2..0..1..1
%e ..1..0..0..1..2..2..0..0....1..2..2..0..1..1..0..1....0..2..2..0..2..2..0..1
%e ..2..1..0..0..1..2..0..2....1..2..0..1..1..2..1..1....1..0..2..2..1..2..2..0
%Y Cf. A206094.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 03 2012