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 #9 Mar 02 2023 14:18:16
%S 7854572,76028256,711793356,10795687000,183567605276,2994560119488,
%T 54588666013136,946322990916328,17957465680336828,316121808578717168,
%U 6072355548317464448,107584942896241083216,2075883483766878489344
%N Number of (n+1) X 7 0..3 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.
%C Column 6 of A205659.
%H R. H. Hardin, <a href="/A205657/b205657.txt">Table of n, a(n) for n = 1..36</a>
%e Some solutions for n=4:
%e ..2..3..0..0..2..0..3....1..0..0..0..0..3..1....3..3..1..0..0..0..0
%e ..3..1..3..2..1..2..1....2..2..0..2..0..3..1....0..3..1..2..3..0..3
%e ..1..1..1..1..1..1..1....1..3..1..0..1..0..2....1..0..3..2..1..3..0
%e ..1..1..1..1..1..1..1....2..3..1..0..1..0..2....1..0..3..0..1..3..0
%e ..0..0..0..1..2..1..3....1..1..3..1..2..1..3....3..2..1..0..2..1..2
%Y Cf. A205659.
%K nonn
%O 1,1
%A _R. H. Hardin_, Jan 30 2012