Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees

DOI10.1142/S179355712250187XzbMath1504.05020arXiv2009.06793OpenAlexW3086881452MaRDI QIDQ5876836

Prodinger, Helmut

Publication date: 2 February 2023

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.06793

zbMATH Keywords

cubic equationternary treesmiddle edges

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Uses Software

• OEIS

Cites Work

• Walks confined in a quadrant are not always D-finite
• On some problems about ternary paths: a linear algebra approach
• The On-Line Encyclopedia of Integer Sequences

This page was built for publication: Counting ternary trees according to the number of middle edges and factorizing into (3/2)-ary trees