# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a219629 Showing 1-1 of 1 %I A219629 #4 Nov 24 2012 08:30:10 %S A219629 10,27,130,582,2109,6637,19166,51491,130209,312797,719186,1591856, %T A219629 3407212,7077248,14307047,28216156,54398922,102703127,190166090, %U A219629 345789073,618191311,1087715590,1885328230,3221762398,5431921305 %N A219629 Number of 3Xn 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..2 3Xn array %C A219629 Row 3 of A219627 %H A219629 R. H. Hardin, Table of n, a(n) for n = 1..210 %F A219629 Empirical: a(n) = (1/20922789888000)*n^16 + (1/523069747200)*n^15 - (127/1046139494400)*n^14 + (79/18681062400)*n^13 + (8441/114960384000)*n^12 - (18343/2874009600)*n^11 + (1687829/7315660800)*n^10 - (3838547/914457600)*n^9 + (5697677311/146313216000)*n^8 + (12383887/74649600)*n^7 - (52929867649/5748019200)*n^6 + (86740702999/718502400)*n^5 - (117558072292519/145297152000)*n^4 + (9685884755689/3632428800)*n^3 - (248063317553/201801600)*n^2 - (269195161/16016)*n + 33755 for n>9 %e A219629 Some solutions for n=3 %e A219629 ..1..1..1....0..0..1....0..0..0....0..0..1....1..1..1....0..0..1....0..0..0 %e A219629 ..1..1..2....1..1..2....0..1..1....0..0..2....1..2..2....1..0..0....0..0..0 %e A219629 ..2..0..0....1..1..2....2..1..2....0..0..2....2..2..2....1..0..1....0..2..2 %K A219629 nonn %O A219629 1,1 %A A219629 _R. H. Hardin_ Nov 24 2012 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE