id:A100625 - OEIS Search Results

Search: id:A100625

Displaying 1-1 of 1 results found.

page 1

Cost of traversing leftmost tree of height n through splaying.

+0
4

0, 4, 16, 48, 114, 250, 528, 1090, 2216, 4472, 9000, 18038, 36116, 72276, 144598, 289254, 578568, 1157200, 2314468, 4629010, 9258112, 18516288, 37032642, 74065368 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`It would be nice to have a formula or recurrence. These numbers were computed by brute force.`
	LINKS	`Colm O Dunlaing (odunlain(AT)maths.tcd.ie), Inorder Traversal of Splay Trees.`
	CROSSREFS	`Cf. A100625.` `Sequence in context: A055342 A050616 A006009 this_sequence A071009 A131126 A058922` `Adjacent sequences: A100622 A100623 A100624 this_sequence A100626 A100627 A100628`
	KEYWORD	`nonn`
	AUTHOR	`njas, Dec 04 2004`
	EXTENSIONS	`Two terms corrected by Colm O Dunlaing, Oct 30 2007`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research