|
%I #4 Nov 21 2012 05:11:19
%S 2,2,3,3,3,4,4,4,6,5,5,5,11,9,6,6,6,24,22,12,7,7,7,43,68,42,15,8,8,8,
%T 70,166,187,74,18,9,9,9,111,380,620,465,124,21,10,10,10,172,821,1961,
%U 2125,1090,199,24,11,11,11,260,1700,5799,9292,6994,2430,307,27,12,12,12,383
%N T(n,k)=Number of nXk 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..1 nXk array
%C Table starts
%C ..2..2...3.....4.......5........6..........7..........8...........9..........10
%C ..3..3...4.....5.......6........7..........8..........9..........10..........11
%C ..4..6..11....24......43.......70........111........172.........260.........383
%C ..5..9..22....68.....166......380........821.......1700........3374........6430
%C ..6.12..42...187.....620.....1961.......5799......16464.......45093......118742
%C ..7.15..74...465....2125.....9292......37442.....146163......554185.....2025086
%C ..8.18.124..1090....6994....42906.....241413....1327694.....7148589....37181863
%C ..9.21.199..2430...22202...193830....1557761...12385870....96913667...731689430
%C .10.24.307..5181...67464...844076....9826087..114366199..1316975534.14632143173
%C .11.27.457.10575..195743..3502384...59070992.1003805024.16988936600
%C .12.30.659.20714..543950.13875479..337978798.8336555749
%C .13.33.924.39046.1452673.52704643.1850253044
%H R. H. Hardin, <a href="/A219519/b219519.txt">Table of n, a(n) for n = 1..178</a>
%e Some solutions for n=3 k=4
%e ..0..0..0..1....0..0..0..1....0..0..0..0....0..0..1..1....0..0..1..1
%e ..0..0..0..1....0..0..0..1....0..0..0..0....0..0..1..1....0..0..0..1
%e ..1..1..1..1....1..0..1..1....1..1..0..0....0..0..1..1....0..0..0..1
%K nonn,tabl
%O 1,1
%A _R. H. Hardin_ Nov 21 2012
|
