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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036600 Number of binary rooted trees with n nodes and height exactly 11. 1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 10, 54, 217, 736, 2238, 6311, 16858, 43262, 107693, 261823, 624756, 1468489, 3409246, 7833514, 17841580, 40327947, 90547126, 202096457, 448654889, 991165733, 2179884354, 4774433308, 10416862098 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,13

LINKS

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

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: A053347 A267172 A266764 * A058645 A170940 A057586

Adjacent sequences:  A036597 A036598 A036599 * A036601 A036602 A036603

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 05:45 EDT 2022. Contains 356986 sequences. (Running on oeis4.)