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 times l has to be repeatedly decreased in step L3.1'.
A079754
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 times l has to be repeatedly decreased in step L3.1'.
Terms
- a(0) =0a(1) =1a(2) =8a(3) =54a(4) =388a(5) =3119a(6) =28092a(7) =280948a(8) =3090464a(9) =37085613a(10) =482113024a(11) =6749582402a(12) =101243736108
External references
- oeis: A079754