id:A135848 - OEIS Search Results

Search: id:A135848

Displaying 1-1 of 1 results found.

page 1

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

+0
1

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

	OFFSET	`2,1`
	REFERENCES	`R. Sedgewick, Permutation generation methods, Computing Surveys, 9 (1977), 137-164.`
	CROSSREFS	`Sequence in context: A044372 A044753 A100766 this_sequence A089548 A117216 A077818` `Adjacent sequences: A135845 A135846 A135847 this_sequence A135849 A135850 A135851`
	KEYWORD	`nonn`
	AUTHOR	`njas, Mar 07 2008`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.