|
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)
|
|
|
|
|
Search completed in 0.002 seconds
|
