29228

Appears in sequences

• Kendall-Mann numbers: the most common number of inversions in a permutation on n letters is floor(n*(n-1)/4); a(n) is the number of permutations with this many inversions.at n=8A000140
• Triangle of Mahonian numbers T(n,k): coefficients in expansion of Product_{i=0..n-1} (1 + x + ... + x^i), where k ranges from 0 to A000217(n-1). Also enumerates permutations by their major index.at n=110A008302
• Largest coefficient in expansion of Product_{i=1..n} (1-q^1+q^2-...+(-q)^i).at n=8A039909
• Triangle, read by rows, where T(n,k) equals the number of permutations of {1..n+1} with [(nk+k)/2] inversions for n>=k>=0.at n=40A128564
• Number of reduced words of length n in the Weyl group A_8.at n=18A161456
• Numbers which are members of both A000140 and A039909.at n=5A179998
• Number of partitions p of n such that 2*min(p) is a part of p.at n=40A238589
• a(n) is the number of permutations of [1..n] that have the same number of inversions as non-inversions.at n=9A316775
• Array read by antidiagonals: A(n,k) is the number of sets of nonempty subsets of a k-element set where each element appears in at most n subsets.at n=61A330964
• Number of ways to partition n labeled elements into sets of different sizes of at least 3.at n=12A341283