A213509 The sequence Z'(n) arising in the enumeration of balanced binary trees.

0, 1, 1, 3, 4, 4, 4, 7, 9, 10, 11, 11, 11, 11, 11, 15, 18, 20, 22, 23, 24, 25, 26, 26, 26, 26, 26, 26, 26, 26, 26, 31, 35, 38, 41, 43, 45, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 57, 57, 57

Offset

1,4

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

Table of n, a(n) for n=1..50.

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: A359807 A259884 A283972 * A112180 A058559 A232092

Adjacent sequences: A213506 A213507 A213508 * A213510 A213511 A213512

Keyword

nonn

Author

N. J. A. Sloane, Jun 12 2012

Status

approved