STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A034781
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Triangle of number of rooted trees with n >= 2 nodes and height h >= 1.
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
FORMULA
T(n, k) = A375467(n, k) - A375467(n, k - 1). - Peter Luschny, Aug 30 2024
PROG
(Python)
def A034781(n, k): return A375467(n, k) - A375467(n, k - 1)
for n in range(2, 10): print([A034781(n, k) for k in range(2, n + 1)])
# Peter Luschny, Aug 30 2024
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
LINKS
J. Riordan, <a href="/A007401/a007401_8.pdf">The enumeration of trees by height and diameter</a>, IBM Journal 4 (1960), 473-478. (Annotated scanned copy)
STATUS
approved
editing
STATUS
editing
approved
STATUS
proposed
approved