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 #4 Dec 07 2012 07:09:26
%S 20,103,1013,6855,42338,264239,1594229,8996095,47638710,240437466,
%T 1169737596,5509527123,25148632606,111340824937,478874919352,
%U 2004763896933,8184273650104,32633248916540,127260159420398
%N Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal, vertical or diagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 4Xn array
%C Row 4 of A220204
%H R. H. Hardin, <a href="/A220207/b220207.txt">Table of n, a(n) for n = 1..203</a>
%e Some solutions for n=3
%e ..1..0..0....0..0..0....0..0..0....1..1..1....1..1..1....1..1..1....1..0..0
%e ..2..0..0....2..0..0....0..0..0....1..0..0....2..1..1....1..1..1....1..0..0
%e ..2..0..0....3..3..0....0..0..0....2..0..0....1..0..0....2..2..2....1..0..0
%e ..3..0..0....3..3..3....2..2..2....3..2..0....1..0..0....2..2..2....3..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Dec 07 2012