Operation count to create all permutations of n distinct elements using the "streamlined" version of Knuth's Algorithm L (lexicographic permutation generation).
A079755
Operation count to create all permutations of n distinct elements using the "streamlined" version of Knuth's Algorithm L (lexicographic permutation generation).
Terms
- a(0) =0a(1) =3a(2) =23a(3) =148a(4) =1054a(5) =8453a(6) =76109a(7) =761126a(8) =8372436a(9) =100469287a(10) =1306100803a(11) =18285411320a(12) =274281169898
External references
- oeis: A079755