login
Number of nX8 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors
0

%I #4 Mar 31 2012 12:35:52

%S 129,113841,33169105,10339213765,3221377019429,1003889179688773,

%T 313000943874975793,97587614786720584857

%N Number of nX8 0..2 arrays with each element equal to either the maximum or the minimum of its horizontal and vertical neighbors

%C Column 8 of A183554

%e Some solutions for 3X8

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Jan 05 2011