|
|
A262292
|
|
Triangle read by rows: T(n, k) = largest possible content of a league (P, S), where P is a set of k-partitions and S is a set of k-subsets of {1, . . . , n}, for n >= 2, 1 <= k <= n-1.
|
|
1
|
|
|
0, 0, 1, 0, 3, 3, 0, 9, 28, 6, 0, 21, 150, 125, 12, 0, 45, 760, 1350, 390, 20
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,5
|
|
LINKS
|
P. J. Cameron, M. Gadouleau, J. D. Mitchell, Y. Peresse, Chains of subsemigroups, arXiv preprint arXiv:1501.06394 [math.GR], 2015.
|
|
EXAMPLE
|
Triangle begins:
0,
0,1,
0,3,3,
0,9,28,6,
0,21,150,125,12,
0,45,760,1350,390,20,
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|