The OEIS is supported by the many generous donors to the OEIS Foundation.

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A036594

Number of binary rooted trees with n nodes and height exactly 5.

0

0, 0, 0, 0, 0, 1, 4, 9, 17, 29, 45, 66, 89, 118, 142, 171, 187, 205, 202, 201, 177, 158, 123, 99, 66, 47, 26, 17, 7, 4, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,7

LINKS

Table of n, a(n) for n=0..31.

E. M. Rains and N. J. A. Sloane, On Cayley's Enumeration of Alkanes (or 4-Valent Trees), J. Integer Sequences, Vol. 2 (1999), Article 99.1.1.

Index entries for sequences related to rooted trees

CROSSREFS

Sequence in context: A057315 A008110 A008224 * A181286 A008138 A301123

Adjacent sequences: A036591 A036592 A036593 * A036595 A036596 A036597

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane.

STATUS

approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

Alternative Proxies:

Alternative Proxy