I want to calculate as fast as possible the n Mahonian (http://oeis.org/A008302) row. to read out the number of permutations length n with k inversions.
This is the way iam doing this currently:
Number of n-element permutations with exactly k inversions
I wonder if there is maybe a faster way? Better Algorithm?