A219471 - OEIS

%I #4 Nov 20 2012 16:30:22

%S 4,4,10,10,23,20,20,68,82,35,35,211,673,239,56,56,547,4838,5040,619,

%T 84,84,1248,28159,87083,32229,1471,120,120,2663,143718,1227441,

%U 1306891,185800,3259,165,165,5432,674954,14696377,43792361,17399442,982456,6800

%N T(n,k)=Number of nXk 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..3 nXk array

%C Table starts

%C ...4.....4.......10..........20...........35............56............84

%C ..10....23.......68.........211..........547..........1248..........2663

%C ..20....82......673........4838........28159........143718........674954

%C ..35...239.....5040.......87083......1227441......14696377.....157191488

%C ..56...619....32229.....1306891.....43792361....1222433026...29873644925

%C ..84..1471...185800....17399442...1357658929...86755752059.4758315482104

%C .120..3259...982456...208345624..37552353044.5432184254977

%C .165..6800..4815782..2285009931.947150536824

%C .220.13464.22059734.23253970439

%C .286.25453.95049799

%C .364.46178

%C .455

%H R. H. Hardin, <a href="/A219471/b219471.txt">Table of n, a(n) for n = 1..83</a>

%e Some solutions for n=3 k=4

%e ..0..0..0..0....0..0..0..2....0..0..2..2....0..0..1..2....0..0..1..1

%e ..0..0..0..0....0..0..2..1....0..0..2..0....1..1..2..3....0..0..2..3

%e ..2..3..0..0....1..1..1..1....0..0..0..0....1..1..2..3....2..3..1..1

%Y Column 1 is A000292(n+1)

%Y Row 1 is A000292 for n>1

%Y Diagonal is A216678

%K nonn,tabl

%O 1,1

%A _R. H. Hardin_ Nov 20 2012