A135848 - OEIS

This site is supported by donations to The OEIS Foundation.

A135848

Number of steps required for a certain algorithm for producing all permutations of n letters.

40, 154, 638, 3194, 19130, 133836, 1070550, 9634750, 96347210, 1059818936, 12717826742 (list; graph; refs; listen; history; internal format)

	OFFSET	`2,1`
	REFERENCES	`R. Sedgewick, Permutation generation methods, Computing Surveys, 9 (1977), 137-164.`
	CROSSREFS	`Sequence in context: A100766 A189541 A201233 * A089548 A146762 A190073` `Adjacent sequences: A135845 A135846 A135847 * A135849 A135850 A135851`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Mar 07 2008`

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

Last modified February 17 18:41 EST 2012. Contains 206074 sequences.