id:A117628 - OEIS Search Results

Search: id:A117628

Displaying 1-1 of 1 results found.

page 1

Let f(n) = average number of comparisons needed for sorting n elements using merge insertion. Sequence gives n!*f(n).

+0
1

0, 2, 16, 112, 832, 6912, 62784, 623232 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`D. E. Knuth, TAOCP, Vol. 3, Section 5.3.1.`
	CROSSREFS	`A117627 is a lower bound.` `Sequence in context: A012024 A058121 A117627 this_sequence A037564 A125725 A088755` `Adjacent sequences: A117625 A117626 A117627 this_sequence A117629 A117630 A117631`
	KEYWORD	`nonn`
	AUTHOR	`njas, Oct 06 2006`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.