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.

0, 0, 1, 0, 3, 3, 0, 9, 28, 6, 0, 21, 150, 125, 12, 0, 45, 760, 1350, 390, 20

Offset

2,5

Links

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

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

Cf. A262291.

Sequence in context: A341748 A120981 A298850 * A100543 A039928 A374828

Adjacent sequences: A262289 A262290 A262291 * A262293 A262294 A262295

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Sep 21 2015

Status

approved