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.

A079884 Number of comparisons 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.

Table of values

n a(n)
3 11
4 54
5 285
6 1731
7 12145
8 97196
9 874809
10 8748145
11 96229661
12 1154756010
13 15011828221
14 210165595199
15 3152483928105
16 50439742849816
17 857475628447025
18 15434561312046621
19 293256664928885989
20 5865133298577719990
21 123167799270132120021
22 2709691583942906640715
23 62322906430686852736721

List of values

[11, 54, 285, 1731, 12145, 97196, 874809, 8748145, 96229661, 1154756010, 15011828221, 210165595199, 3152483928105, 50439742849816, 857475628447025, 15434561312046621, 293256664928885989, 5865133298577719990, 123167799270132120021, 2709691583942906640715, 62322906430686852736721]

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

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