cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A080049 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 interchange operations in step L4.

Table of values

n a(n)
2 0
3 2
4 11
5 63
6 388
7 2734
8 21893
9 197069
10 1970726
11 21678036
12 260136487
13 3381774403
14 47344841720
15 710172625898
16 11362762014473
17 193166954246169
18 3477005176431178
19 66063098352192544
20 1321261967043851051
21 27746501307920872271
22 610423028774259190172
23 14039729661807961374198

List of values

[0, 2, 11, 63, 388, 2734, 21893, 197069, 1970726, 21678036, 260136487, 3381774403, 47344841720, 710172625898, 11362762014473, 193166954246169, 3477005176431178, 66063098352192544, 1321261967043851051, 27746501307920872271, 610423028774259190172, 14039729661807961374198]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.