Kendall-Mann numbers: the maximal number of inversions in a permutation on n letters is floor(n(n-1)/4); a(n) = number of permutations with this many inversions.
1, 1, 2, 6, 22, 101, 573, 3836, 29228, 250749, 2409581, 25598186, 296643390
1 seqfan posts
Fri Oct 29 05:35:16 CEST 2010 [seqfan] Implementing first 500 sequences in Java