login
Number of (n+1)X8 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor
1

%I #5 Mar 31 2012 12:37:06

%S 750426,43434216,3703472454,291860355624,23817299324910,

%T 1873315597879056,153727495029223899,12064169543471230344,

%U 990342568808823237237,77725844134691110148598,6379845168269713848869523

%N Number of (n+1)X8 0..2 arrays with the number of clockwise edge increases in every 2X2 subblock differing from each horizontal or vertical neighbor

%C Column 7 of A205520

%H R. H. Hardin, <a href="/A205519/b205519.txt">Table of n, a(n) for n = 1..23</a>

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 28 2012