|
|
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
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|