login
Half the number of (n+1)X7 0..2 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference
1

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

%S 852768,684469520,547050257224,437792367422004,350242477812932534,

%T 280228918282467201434,224204660538155238268018,

%U 179382625331280966120917002,143520826707743446496036408692

%N Half the number of (n+1)X7 0..2 arrays with every 2X2 subblock having at most one duplicate clockwise edge difference

%C Column 6 of A209951

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 16 2012