Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Dec 12 2015 18:01:30
%S 26481,594348,14528199,369441411,9567269487,249853070682,
%T 6556642024200,172503406693200,4545389492802288,119878356782179572,
%U 3163274433238575696,83498862564488470557,2204480938367057407965,58208728563598806225396
%N Number of (n+1) X 6 0..2 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing, and counterclockwise edge increases nonincreasing, rightwards and downwards.
%C Column 5 of A206542.
%H R. H. Hardin, <a href="/A206539/b206539.txt">Table of n, a(n) for n = 1..210</a>
%e Some solutions for n=4:
%e ..1..1..2..1..1..0....2..1..0..1..1..2....2..1..2..1..0..0....0..2..1..2..1..2
%e ..1..2..2..1..0..0....1..1..0..0..1..1....2..1..1..1..0..2....2..1..2..0..2..0
%e ..2..2..1..1..0..2....0..0..0..1..1..0....2..1..2..1..0..2....0..2..0..1..0..1
%e ..1..1..1..0..0..2....2..2..0..1..0..0....1..1..2..1..0..2....1..0..1..2..1..0
%e ..0..0..0..0..2..2....1..2..0..1..0..2....0..1..1..1..0..0....2..1..0..1..2..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 09 2012