login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Half the number of (n+1)X8 0..2 arrays with every 2X2 subblock having two or three distinct clockwise edge differences
1

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

%S 7895856,19537398722,48490791961375,120443009719061218,

%T 299192733780770135628,743245692531829336470460,

%U 1846356382998737252290206762,4586687051164609867229232781805

%N Half the number of (n+1)X8 0..2 arrays with every 2X2 subblock having two or three distinct clockwise edge differences

%C Column 7 of A210276

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

%e Some solutions for n=4

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

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

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 19 2012