id:A117627 - OEIS Search Results

Search: id:A117627

Displaying 1-1 of 1 results found.

page 1

Let f(n) = minimum of average number of comparisons needed for any sorting method for n elements, and let g(n) = n!*f(n). Sequence gives a lower bound on g(n).

+0
2

0, 2, 16, 112, 832, 6896, 62368, 619904 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`D. E. Knuth, TAOCP, Vol. 3, Section 5.3.1.`
	FORMULA	`Knuth gives an explicit formula.`
	CROSSREFS	`Cf. A117627.` `Sequence in context: A009619 A012024 A058121 this_sequence A117628 A037564 A125725` `Adjacent sequences: A117624 A117625 A117626 this_sequence A117628 A117629 A117630`
	KEYWORD	`nonn,more`
	AUTHOR	`njas, Oct 06 2006`

page 1

Search completed in 0.003 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research