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 total executions of step L3.1'.
A079753
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 total executions of step L3.1'.
Terms
- a(0) =0a(1) =3a(2) =21a(3) =136a(4) =967a(5) =7757a(6) =69841a(7) =698446a(8) =7682951a(9) =92195467a(10) =1198541137a(11) =16779575996a(12) =251693640031
External references
- oeis: A079753