|
Search: id:A115321
|
|
|
| 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. |
|
+0
2
|
|
| 1, 5, 2, 7, 3, 3, 9, 7, 4, 3, 11, 8, 5, 5, 4, 13, 10, 8
(list; table; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
REFERENCES
|
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 A115320 for transposed array.
Sequence in context: A094772 A093591 A132800 this_sequence A127108 A093606 A064677
Adjacent sequences: A115318 A115319 A115320 this_sequence A115322 A115323 A115324
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Mar 07 2006
|
|
|
Search completed in 0.002 seconds
|
