cp's OEIS Frontend

A246982 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).

%I A246982 #7 Sep 14 2014 23:20:36
%S A246982 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 A246982 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 A246982 53,55,6,12,18,26,30,36,46,54,60,64,66,6,13,20
%N A246982 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 A246982 Triangle begins:
%e A246982 1,
%e A246982 1,3,
%e A246982 2,4,6,
%e A246982 2,4,8,10,
%e A246982 3,6,9,13,15,
%e A246982 3,7,9,15,19,21,
%e A246982 4,8,12,16,22,26,28,
%e A246982 4,9,14,16,24,30,34,36,
%e A246982 5,10,16,20,25,33,39,43,45,
%e A246982 5,11,17,23,25,35,43,49,53,55,
%e A246982 ...
%Y A246982 A034856 is a diagonal.
%K A246982 nonn,tabl
%O A246982 2,3
%A A246982 _N. J. A. Sloane_, Sep 14 2014