login
Triangle read by rows: T(n,k) = maximal number of inversions among all k-sorted permutations on n letters (n>=2, 1<=k<=n-1).
0

%I #7 Sep 14 2014 23:20:36

%S 1,1,3,2,4,6,2,4,8,10,3,6,9,13,15,3,7,9,15,19,21,4,8,12,16,22,26,28,4,

%T 9,14,16,24,30,34,36,5,10,16,20,25,33,39,43,45,5,11,17,23,25,35,43,49,

%U 53,55,6,12,18,26,30,36,46,54,60,64,66,6,13,20

%N Triangle read by rows: T(n,k) = maximal number of inversions among all k-sorted permutations on n letters (n>=2, 1<=k<=n-1).

%e Triangle begins:

%e 1,

%e 1,3,

%e 2,4,6,

%e 2,4,8,10,

%e 3,6,9,13,15,

%e 3,7,9,15,19,21,

%e 4,8,12,16,22,26,28,

%e 4,9,14,16,24,30,34,36,

%e 5,10,16,20,25,33,39,43,45,

%e 5,11,17,23,25,35,43,49,53,55,

%e ...

%Y A034856 is a diagonal.

%K nonn,tabl

%O 2,3

%A _N. J. A. Sloane_, Sep 14 2014