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 #7 Dec 13 2015 18:44:39
%S 68253,815847,16537155,404408697,10351091007,269149632948,
%T 7050554283159,185345018259540,4881926323170807,128725692827947026,
%U 3396388515566281998,89646186585961013220,2366709977280568630851,62491059857755655009379
%N Number of (n+1) X 6 0..2 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors.
%C Column 5 of A206668.
%H R. H. Hardin, <a href="/A206665/b206665.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4:
%e ..2..0..1..2..0..1....0..2..0..2..0..1....0..2..0..0..1..2....2..0..1..0..0..0
%e ..1..2..1..2..0..0....1..0..1..0..1..0....0..2..2..0..1..1....2..0..0..0..1..0
%e ..0..2..1..2..0..1....2..1..0..1..0..1....2..2..0..0..1..2....2..2..2..0..1..1
%e ..2..2..2..2..0..1....1..0..1..2..1..2....0..2..2..0..1..1....0..0..2..0..0..0
%e ..2..0..2..0..0..1....2..1..2..0..2..1....0..2..0..0..1..0....0..2..2..0..2..2
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 11 2012