A206066 - OEIS

%I #9 Jun 13 2018 11:24:02

%S 150,606,3330,18534,103194,574182,3193722,17762598,98788410,549418086,

%T 3055619322,16993990566,94512979386,525638931174,2923368683130,

%U 16258469332518,90422335862586,502888596377958,2796841487745018

%N Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three clockwise edge increases.

%C Column 2 of A206072.

%H R. H. Hardin, <a href="/A206066/b206066.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 7*a(n-1) - 8*a(n-2) for n>6.

%F Empirical g.f.: 6*x*(25 - 74*x + 48*x^2 + 12*x^3 + 16*x^4 + 16*x^5) / (1 - 7*x + 8*x^2). - _Colin Barker_, Jun 13 2018

%e Some solutions for n=4:

%e ..1..0..0....0..0..1....2..1..0....1..2..0....0..1..0....0..1..2....2..0..0

%e ..0..2..1....2..1..2....0..2..1....1..0..2....0..2..1....2..1..1....1..2..1

%e ..1..0..2....0..2..0....1..0..2....0..1..0....1..0..2....1..0..2....2..1..2

%e ..2..1..0....1..0..2....2..1..0....1..2..1....0..2..0....2..1..0....1..0..2

%e ..1..0..1....2..1..0....0..2..1....0..0..2....1..0..1....0..2..1....2..1..0

%Y Cf. A206072.

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 03 2012