The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213508 The sequence Z(n) arising in the enumeration of balanced binary trees. 0
 1, 3, 4, 7, 9, 10, 11, 15, 18, 20, 22, 23, 24, 25, 26, 31, 35, 38, 41, 43, 45, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 63, 68, 72, 76, 79, 82, 85, 88, 90, 92, 94, 96, 98, 100, 102, 104, 105, 106, 107 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS See Cha (2012) for the precise definition. REFERENCES Hsien-Kuei Hwang, S Janson, TH Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, Preprint, 2016; http://140.109.74.92/hk/wp-content/files/2016/12/aat-hhrr-1.pdf. Also Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, 13:4 (2017), #47; DOI: 10.1145/3127585 LINKS Sung-Hyuk Cha, On Integer Sequences Derived from Balanced k-ary Trees, Applied Mathematics in Electrical and Computer Engineering, 2012. Sung-Hyuk Cha, On Complete and Size Balanced k-ary Tree Integer Sequences, International Journal of Applied Mathematics and Informatics, Issue 2, Volume 6, 2012, pp. 67-75. - From N. J. A. Sloane, Dec 24 2012 CROSSREFS Sequence in context: A057709 A139442 A037988 * A088958 A300061 A300789 Adjacent sequences:  A213505 A213506 A213507 * A213509 A213510 A213511 KEYWORD nonn AUTHOR N. J. A. Sloane, Jun 12 2012 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.

Last modified March 30 10:09 EDT 2020. Contains 333125 sequences. (Running on oeis4.)