login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A100625
Cost of traversing leftmost tree of height n through splaying.
2
0, 4, 16, 48, 114, 250, 528, 1090, 2216, 4472, 9000, 18038, 36116, 72276, 144598, 289254, 578568, 1157200, 2314468, 4629010, 9258112, 18516288, 37032642, 74065368
OFFSET
0,2
COMMENTS
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: A297160 A006009 A261977 * A203248 A223839 A071009
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 04 2004
EXTENSIONS
Two terms corrected by Colm O Dunlaing, Oct 30 2007
STATUS
approved