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

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

%S 10876432,3053150968,1185601231024,461355684937208,178097908817359584,

%T 68862365329186909360,26629795409510135065440,

%U 10296713802508008634192456,3981422133075217184705209320

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

%C Column 6 of A205466

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 27 2012