login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
Colm O Dunlaing (odunlain(AT)maths.tcd.ie), Inorder Traversal of Splay Trees.
CROSSREFS
Cf. A100625.
Sequence in context: A105660 A056681 A192959 * A320586 A088809 A364534
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)