Operation count to create all permutations of n distinct elements using 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.
A080047
Operation count to create all permutations of n distinct elements using 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.
Terms
- a(0) =0a(1) =1a(2) =7a(3) =41a(4) =256a(5) =1807a(6) =14477a(7) =130321a(8) =1303246a(9) =14335751a(10) =172029067a(11) =2236377937a(12) =31309291196a(13) =469639368031
External references
- oeis: A080047