|
| |
|
|
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
|
|
|
|
1, 2, 5, 3, 3, 7, 3, 4, 7, 9, 4, 5, 5, 8, 11
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
