Skip to content

A079752

OEIS Lean4

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 the search for an element exchangeable with a_j has to be started.

offset: 3
codomain: ℕ