login
Number of (n+1) X 6 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.
1

%I #7 Dec 10 2015 02:05:34

%S 656272,4601832,59081744,692354440,8605131924,103395482496,

%T 1315300941940,16790996352160,212427830322448,2664535764436976,

%U 33937686112451748,433288983172028616,5498445523621536928,69569004855726603032

%N Number of (n+1) X 6 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.

%C Column 5 of A205944.

%H R. H. Hardin, <a href="/A205941/b205941.txt">Table of n, a(n) for n = 1..83</a>

%e Some solutions for n=4:

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_, Feb 01 2012