

A213509


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


0



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
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

See Cha (2012) for the precise definition.


REFERENCES

HsienKuei 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/wpcontent/files/2016/12/aathhrr1.pdf. Also Exact and Asymptotic Solutions of a DivideandConquer 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.
SungHyuk Cha, On Integer Sequences Derived from Balanced kary Trees, Applied Mathematics in Electrical and Computer Engineering, 2012.
SungHyuk Cha, On Complete and Size Balanced kary Tree Integer Sequences, International Journal of Applied Mathematics and Informatics, Issue 2, Volume 6, 2012, pp. 6775.  From N. J. A. Sloane, Dec 24 2012


CROSSREFS

Sequence in context: A022484 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



