The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A344613 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A344613

Number of rooted binary trees (in which all inner nodes have precisely two children) with n leaves and with maximal number of cherries (i.e., maximal number of pendant subtrees with two leaves).
(history; published version)

#39 by Alois P. Heinz at Thu Jun 10 15:03:02 EDT 2021

STATUS

editing

approved

#38 by Alois P. Heinz at Thu Jun 10 15:03:00 EDT 2021

LINKS

S. J. Kersting and M. Fischer, <a href="https://arxiv.org/abs/2105.00719">Measuring tree balance using symmetry nodes - a new balance index and its extremal properties.</a>, arXiv:2105.00719 [q-bio.PE], 2021.

STATUS

approved

editing

#37 by Alois P. Heinz at Thu Jun 10 15:02:36 EDT 2021

STATUS

editing

approved

#36 by Alois P. Heinz at Thu Jun 10 15:02:33 EDT 2021

LINKS

STATUS

approved

editing

#35 by Alois P. Heinz at Thu Jun 10 11:08:15 EDT 2021

STATUS

editing

approved

#34 by Alois P. Heinz at Thu Jun 10 11:08:11 EDT 2021

LINKS

Alois P. Heinz, <a href="/A344613/b344613.txt">Table of n, a(n) for n = 1..5000</a>

STATUS

approved

editing

#33 by Joerg Arndt at Thu Jun 10 01:45:42 EDT 2021

STATUS

reviewed

approved

#32 by Michel Marcus at Thu Jun 10 00:29:59 EDT 2021

STATUS

proposed

reviewed

#31 by Jon E. Schoenfield at Wed Jun 09 23:46:39 EDT 2021

STATUS

editing

proposed

#30 by Jon E. Schoenfield at Wed Jun 09 23:46:37 EDT 2021

AUTHOR

Mareike Fischer, Jun 09 2021.