|
%I #4 Nov 25 2012 17:28:44
%S 5,9,45,158,518,1648,5007,14438,39672,104598,266066,654865,1562327,
%T 3617918,8142834,17834820,38060775,79238739,161130031,320412547,
%U 623782761,1190206617,2228054743,4096067946,7401902650,13159096823
%N Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 nX5 array
%C Column 5 of A219704
%H R. H. Hardin, <a href="/A219701/b219701.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = (1/88921857024000)*n^17 - (1/1162377216000)*n^16 + (31/653837184000)*n^15 - (197/174356582400)*n^14 - (4001/373621248000)*n^13 + (577/236544000)*n^12 - (2904113/25147584000)*n^11 + (800927/243855360)*n^10 - (2143102117/36578304000)*n^9 + (11942386187/24385536000)*n^8 + (5154831961/898128000)*n^7 - (86591775469/319334400)*n^6 + (264385484044277/54486432000)*n^5 - (11802550744248367/217945728000)*n^4 + (3653502793034617/9081072000)*n^3 - (589380100276909/302702400)*n^2 + (4888713642409/875160)*n - 7237310 for n>11
%e Some solutions for n=3
%e ..0..0..0..1..1....0..0..0..0..1....0..0..0..0..1....0..0..0..0..0
%e ..0..0..1..1..1....0..0..0..0..1....0..0..0..1..1....0..0..0..0..0
%e ..0..0..1..1..1....1..0..0..1..1....0..0..0..1..1....1..1..0..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 25 2012
|
