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!)
A001138 Red rooted red-black trees with n internal nodes. 0

%I #18 Jan 11 2013 16:34:33

%S 1,0,1,4,6,4,2,8,32,96,256,608,1268,2392,4177,6720,9976,14064,19882,

%T 30952,59080,138096,355734,929040,2380268,5940408,14466720,34499984,

%U 80786736,186018208,421400951,939336288,2060601888,4450171328,9468023540

%N Red rooted red-black trees with n internal nodes.

%H F. Ruskey, <a href="http://www.theory.cs.uvic.ca/~cos/inf/tree/RedBlackTree.html">Information on Red-Black Trees</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Red-BlackTree.html">Red-Black Tree.</a>

%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>

%K nonn

%O 1,4

%A _Frank Ruskey_

%E More terms from _Sean A. Irvine_, Mar 08 2012

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 June 29 16:14 EDT 2024. Contains 373851 sequences. (Running on oeis4.)