Number of comparisons required to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2.
A079884
Number of comparisons required to create all permutations of n distinct elements using the "streamlined" version of Algorithm L (lexicographic permutation generation) from Knuth's The Art of Computer Programming, Vol. 4, chapter 7.2.1.2.
Terms
- a(0) =11a(1) =54a(2) =285a(3) =1731a(4) =12145a(5) =97196a(6) =874809a(7) =8748145a(8) =96229661a(9) =1154756010a(10) =15011828221a(11) =210165595199
External references
- oeis: A079884