The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Mar 31 2012 12:37:10
%S 37735460,35674679732,34006136221640,32327015669963752,
%T 30663225851582320716,29048689240586916141284,
%U 27501116060342502948845780,26027294273532996135747769404,24628320993481612254311730982740
%N Number of (n+1)X8 0..3 arrays with the number of clockwise edge increases in every 2X2 subblock equal to two
%C Column 7 of A206197
%H R. H. Hardin, <a href="/A206196/b206196.txt">Table of n, a(n) for n = 1..167</a>
%e Some solutions for n=4
%e ..3..2..3..1..2..2..2..1....2..2..2..1..2..0..1..0....3..2..0..2..2..3..0..0
%e ..2..3..0..3..1..0..3..2....1..0..3..2..3..2..2..1....0..3..1..0..3..2..2..1
%e ..3..0..2..0..2..1..0..3....3..2..0..3..1..0..3..2....1..0..3..2..1..0..3..2
%e ..2..2..3..1..3..2..1..0....0..3..1..0..2..1..0..3....0..1..0..3..2..1..0..3
%e ..1..0..2..3..2..1..0..3....1..0..2..1..3..2..1..0....1..2..1..0..3..2..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Feb 04 2012