login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100624 Cost of traversing complete tree of height n through splaying. 2
0, 3, 10, 27, 62, 135, 282, 589, 1204, 2437, 4904, 9847, 19734, 39511, 79066, 158187, 316430, 632919, 1265898, 2531865, 5063800, 10127673, 20255420, 40510931 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

It would be nice to have a formula or recurrence. These numbers were computed by brute force.

LINKS

Table of n, a(n) for n=0..23.

Colm O Dunlaing (odunlain(AT)maths.tcd.ie), Inorder Traversal of Splay Trees.

CROSSREFS

Cf. A100625.

Sequence in context: A105660 A056681 A192959 * A320586 A088809 A069229

Adjacent sequences:  A100621 A100622 A100623 * A100625 A100626 A100627

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Dec 04 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 22:29 EST 2019. Contains 329850 sequences. (Running on oeis4.)