|
%I
%S 40,154,638,3194,19130,133836,1070550,9634750,96347210,1059818936,
%T 12717826742
%N Number of steps required for a certain algorithm for producing all permutations of n letters.
%H R. Sedgewick, <a href="http://homepage.math.uiowa.edu/~goodman/22m150.dir/2007/Permutation%20Generation%20Methods.pdf">Permutation generation methods</a>, Computing Surveys, 9 (1977), 137-164.
%K nonn,more
%O 2,1
%A _N. J. A. Sloane_, Mar 07 2008
|
