A generalized tableau associated with colored convolution trees (Q1182953): Difference between revisions

Families of trees with coloured nodes are constructed by certain convolution processes, and the numbers of nodes of each colour at each level are tabulated. The entries in the table are connected by recurrence relations. The authors study connections with generalized Pascal's triangles and Fibonacci sequences, and relate the results to earlier work [\textit{J. C. Turner}, New Zealand Math. Soc. Newsletter, 16-27 (1985)].