|
| |
|
|
A079750
|
|
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 comparisons required to find j in step L2.2'.
|
|
10
| |
|
|
0, 4, 25, 156, 1099, 8800, 79209, 792100, 8713111, 104557344, 1359245485, 19029436804, 285441552075, 4567064833216, 77640102164689, 1397521838964420, 26552914940323999, 531058298806480000, 11152224274936080021
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,2
|
|
|
COMMENTS
| The asymptotic value for large n is 0.21828...*n! See also comment for A079884
|
|
|
REFERENCES
| See under A079884
|
|
|
LINKS
| Hugo Pfoertner, FORTRAN program for lexicographic permutation generation.
|
|
|
FORMULA
| a(3)=0, a(n) = n * a(n-1) + n for n>=4
Sum((n+1)!/j!,j=3..n). - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 20 2006
For n>=3, a(n)=floor((e-5/2)*n!-1/2). - Benoit Cloitre, Aug 03 2007
|
|
|
MAPLE
| a:=n->sum((n+1)!/j!, j=3..n): seq(a(n), n=2..20); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Oct 20 2006
|
|
|
MATHEMATICA
| a[3] = 0; a[n_] := n*a[n - 1] + n; Table[a[n], {n, 3, 21}]
|
|
|
PROG
| FORTRAN program available at link
|
|
|
CROSSREFS
| Cf. A079884, A079751, A079752, A079753, A079754, A079755, A079756.
Sequence in context: A055846 A091634 A010909 * A195510 A073517 A184755
Adjacent sequences: A079747 A079748 A079749 * A079751 A079752 A079753
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 14 2003
|
|
|
EXTENSIONS
| Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 22 2003
|
| |
|
|
