Operation count 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. Sequence gives number of interchanges in reversal step.
A079756
Operation count 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. Sequence gives number of interchanges in reversal step.
Terms
- a(0) =0a(1) =0a(2) =4a(3) =29a(4) =215a(5) =1734a(6) =15630a(7) =156327a(8) =1719637a(9) =20635688a(10) =268264004a(11) =3755696121a(12) =56335441899a(13) =901367070474
External references
- oeis: A079756