login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of (n+1) X 3 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases.
1

%I #7 Dec 13 2015 21:27:56

%S 2208,37408,643968,11074704,190505040,3276916896,56368726448,

%T 969636795792,16679397182912,286913899633552,4935405551063120,

%U 84897343122802464,1460378241835515568,25120981773756588368

%N Number of (n+1) X 3 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 2 of A207799.

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

%F Empirical: a(n) = 9*a(n-1) +121*a(n-2) +356*a(n-3) +96*a(n-4) -3604*a(n-5) -18396*a(n-6) -28488*a(n-7) +1440*a(n-8) +10656*a(n-9) +3456*a(n-10).

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 20 2012