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 Jun 22 2022 02:09:18
%S 319784,61330824,9355289120,1235093642064,148812223113936,
%T 16821962566961468,1815101219263424368,189063838791570094396,
%U 19160494324515331059260,1900000815802284473378920
%N Number of (n+1) X 5 0..3 arrays with the number of clockwise edge increases in 2 X 2 subblocks nondecreasing rightwards and downwards.
%C Column 4 of A205935.
%H R. H. Hardin, <a href="/A205931/b205931.txt">Table of n, a(n) for n = 1..29</a>
%e Some solutions for n=4
%e ..3..0..1..1..1....1..3..0..0..1....1..3..3..3..2....0..0..1..1..1
%e ..1..2..0..3..2....3..2..2..1..2....0..2..1..0..3....1..2..0..3..2
%e ..1..3..1..0..3....2..1..3..2..1....1..0..2..1..0....0..0..3..2..1
%e ..3..0..2..1..0....1..2..0..3..2....2..1..3..2..1....2..1..0..3..2
%e ..1..1..3..2..1....0..0..1..0..3....1..0..0..3..2....3..2..1..0..3
%Y Cf. A205935.
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 01 2012