Number of index tests 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.
A079885
Number of index tests 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) =0a(1) =4a(2) =29a(3) =185a(4) =1314a(5) =10534a(6) =94839a(7) =948427a(8) =10432748a(9) =125193032a(10) =1627509489a(11) =22785132925
External references
- oeis: A079885