A036598 - OEIS

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.

A036598

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

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 35, 117, 338, 891, 2208, 5240, 12051, 27060, 59630, 129389, 277146, 586953, 1230801, 2557766, 5272384, 10786683, 21916364, 44242295, 88774290, 177117257, 351481202, 693942477, 1363437316, 2666412440

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

OFFSET

0,11

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..511

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: A266762 A220889 A285240 * A229403 A059824 A248882

Adjacent sequences: A036595 A036596 A036597 * A036599 A036600 A036601

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane.

STATUS

approved

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.

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