A115320 Triangle read by rows. Let L(m,n) = largest integer such that if each symbol in an m X n array appears at most L(m,n) times, then the array must have a transversal. Values are shown in this order: L(m,n), n>=2, m=n, n-1, n-2, ...,2.

1, 2, 5, 3, 3, 7, 3, 4, 7, 9, 4, 5, 5, 8, 11

Offset

2,2

Links

Table of n, a(n) for n=2..16.

S. K. Stein and S. Szabo, The number of distinct symbols in sections of rectangular arrays, Discr. Math., 306 (2006), 254-261.

Example

Array begins
1
5 2
7 3 3
9 7 4 3
11 8 5 5 4
13 10 8 ...

Crossrefs

See A115321 for transposed array.

Sequence in context: A185581 A151960 A281300 * A073480 A077057 A359684

Adjacent sequences: A115317 A115318 A115319 * A115321 A115322 A115323

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Mar 07 2006

Status

approved