A262294 - OEIS

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.

%I #15 Jan 05 2016 11:15:16

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

%N 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.

%H P. J. Cameron, M. Gadouleau, J. D. Mitchell, Y. Peresse, <a href="http://arxiv.org/abs/1501.06394">Chains of subsemigroups</a>, arXiv preprint arXiv:1501.06394 [math.GR], 2015.

%e Triangle begins:

%e 0,

%e 0,1,

%e 0,3,2,

%e 0,6,12,4

%e 0,12,40,30,6

%e 0,20,100,150,66,9

%e ...

%Y Cf. A262293.

%K nonn,tabl,more

%O 2,5

%A _N. J. A. Sloane_, Sep 21 2015