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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005152 Rotation distance between binary trees on n nodes.
(Formerly M0963)
0
0, 1, 2, 4, 5, 7, 9, 11, 12, 15, 16, 18, 20, 22, 24, 26, 28, 30, 32 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Sleator et al. conjecture that a(n) = 2n-6 for all n >= 11.

REFERENCES

Dehornoy, Patrick, On the rotation distance between binary trees. Adv. Math. 223 (2010), no. 4, 1316-1355.

D. D. Sleator, R. E. Tarjan and W. P. Thurston, Rotation distance, in T. M. Cover and Gopinath, eds., Open Problems in Communication and Computation, Springer, NY 1987, pp. 130-137.

Sleator, Daniel D.; Tarjan, Robert E.; Thurston, William P. Rotation distance, triangulations and hyperbolic geometry. J. Amer. Math. Soc. 1 (1988), no. 3, 647-681.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Index entries for sequences related to trees

CROSSREFS

Sequence in context: A047379 A093848 A049039 * A060831 A073727 A075692

Adjacent sequences:  A005149 A005150 A005151 * A005153 A005154 A005155

KEYWORD

nonn,nice,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 16:41 EST 2012. Contains 205938 sequences.