A080047 - cp's OEIS frontend

A080047 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 times l has to be repeatedly decreased in step L3.

n	a(n)
2	0
3	1
4	7
5	41
6	256
7	1807
8	14477
9	130321
10	1303246
11	14335751
12	172029067
13	2236377937
14	31309291196
15	469639368031
16	7514229888601
17	127741908106337
18	2299354345914202
19	43687732572369991
20	873754651447399991

[0, 1, 7, 41, 256, 1807, 14477, 130321, 1303246, 14335751, 172029067, 2236377937, 31309291196, 469639368031, 7514229888601, 127741908106337, 2299354345914202, 43687732572369991, 873754651447399991]

cp's OEIS Frontend

A080047 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 times l has to be repeatedly decreased in step L3.

Table of values

List of values