A115321 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A115321

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=2, 3, ..., n-1, n.

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

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,2

LINKS

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

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

5 2

7 3 3

9 7 4 3

11 8 5 5 4

13 10 8 ...

CROSSREFS

See A115320 for transposed array.

Sequence in context: A132800 A348432 A183167 * A127108 A196405 A352406

Adjacent sequences: A115318 A115319 A115320 * A115322 A115323 A115324

KEYWORD

nonn,tabl,more

AUTHOR

N. J. A. Sloane, Mar 07 2006

STATUS

approved