|
%I #6 Nov 20 2012 17:09:37
%S 10,23,84,315,957,2792,7472,18910,45821,106497,238299,515292,1080657,
%T 2205286,4390769,8547511,16297421,30480517,55990723,101135570,
%U 179818410,314994970,544079375,927296441,1560435245,2594104692,4262492403
%N Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..2 3Xn array
%C Row 3 of A219381
%H R. H. Hardin, <a href="/A219383/b219383.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = (1/20922789888000)*n^16 - (1/237758976000)*n^15 + (269/1046139494400)*n^14 - (61/7472424960)*n^13 + (1943/16422912000)*n^12 + (21517/7185024000)*n^11 - (1297279/7315660800)*n^10 + (266365/73156608)*n^9 - (3097589969/146313216000)*n^8 - (1214098793/2612736000)*n^7 + (8357493713/821145600)*n^6 - (827698471/13063680)*n^5 - (92069549514517/435891456000)*n^4 + (89775326103539/18162144000)*n^3 - (14226973583203/605404800)*n^2 + (20337873821/720720)*n + 39675 for n>16
%e Some solutions for n=3
%e ..0..1..0....0..0..1....1..1..2....1..1..2....1..1..1....1..1..1....0..0..0
%e ..0..0..0....1..0..0....1..1..2....2..1..2....1..1..1....1..1..1....0..0..0
%e ..0..2..0....2..0..1....1..1..2....2..2..2....2..2..2....1..1..2....2..0..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 19 2012
|
