A100625 - OEIS

%I #4 Mar 30 2012 16:50:06

%S 0,4,16,48,114,250,528,1090,2216,4472,9000,18038,36116,72276,144598,

%T 289254,578568,1157200,2314468,4629010,9258112,18516288,37032642,

%U 74065368

%N Cost of traversing leftmost tree of height n through splaying.

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

%H Colm O Dunlaing (odunlain(AT)maths.tcd.ie), <a href="http://citeseer.ist.psu.edu/650738.html">Inorder Traversal of Splay Trees</a>.

%Y Cf. A100625.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Dec 04 2004

%E Two terms corrected by Colm O Dunlaing, Oct 30 2007