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 27 2012 06:11:18
%S 5,12,65,291,1229,4795,17186,57060,177629,522893,1463248,3907906,
%T 9995404,24562967,58167281,133102296,295046074,635009083,1329686297,
%U 2713960089,5408407498,10539086474,20109317083,37617526854,69067009601,124590363723
%N Number of nX5 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 nX5 array
%C Column 5 of A219773
%H R. H. Hardin, <a href="/A219770/b219770.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = (1/11115232128000)*n^17 - (1/326918592000)*n^16 + (1/40864824000)*n^15 + (493/65383718400)*n^14 - (9683/23351328000)*n^13 + (89521/7185024000)*n^12 - (4429/25872000)*n^11 - (1645507/914457600)*n^10 + (728164123/4572288000)*n^9 - (20102513087/4572288000)*n^8 + (17194555969/224532000)*n^7 - (1333369888691/1437004800)*n^6 + (2585848906270391/326918592000)*n^5 - (2492152164682039/54486432000)*n^4 + (1458815480632777/9081072000)*n^3 - (33613023582311/151351200)*n^2 - (38919626189/85085)*n + 1608736 for n>10
%e Some solutions for n=3
%e ..0..0..0..1..1....0..0..0..0..1....0..0..0..0..0....0..0..0..0..0
%e ..0..1..1..1..1....0..0..0..1..1....0..0..0..1..1....0..0..0..0..0
%e ..1..1..1..1..1....0..0..1..1..1....0..0..0..1..1....0..1..0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 27 2012