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 Nov 19 2012 05:39:41
%S 35,514,28365,1205110,39601472,1107664956,28236528076,667666691778,
%T 14642492775178,298928117986448,5715959414032253,103086138172521449,
%U 1763934238183179653,28774925950415540046,449294265016455468001
%N Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or vertical neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..3 nX5 array
%C Column 5 of A219373
%H R. H. Hardin, <a href="/A219370/b219370.txt">Table of n, a(n) for n = 1..27</a>
%e Some solutions for n=3
%e ..0..0..0..1..1....2..2..2..2..3....1..1..1..1..0....0..0..1..1..0
%e ..0..0..0..0..1....2..0..0..2..0....1..1..1..0..0....0..0..1..0..0
%e ..0..3..0..1..1....0..0..0..0..0....1..3..3..3..0....0..2..3..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 19 2012