A262294 Triangle read by rows: T(n, k) = largest possible content of a league (P, S), where P consists of k-partitions corresponding to kernels of order-preserving transformations and S is a set of k-subsets of {1, . . . , n}, for n >= 2, 1 <= k <= n-1.

0, 0, 1, 0, 3, 2, 0, 6, 12, 4, 0, 12, 40, 30, 6, 0, 20, 100, 150, 66, 9

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,2,
0,6,12,4
0,12,40,30,6
0,20,100,150,66,9
...

Crossrefs

Cf. A262293.

Sequence in context: A257653 A246834 A319730 * A080779 A355090 A319830

Adjacent sequences: A262291 A262292 A262293 * A262295 A262296 A262297

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Sep 21 2015

Status

approved