login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036592 Number of binary rooted trees with n nodes and height at most 9. 2
1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 206, 441, 928, 1951, 4046, 8349, 17062, 34703, 70112, 141071, 282420, 563333, 1119020, 2215310, 4369699, 8591513, 16836216, 32891454, 64057841, 124388194, 240827283, 464938673, 895070853, 1718386387 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

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: A036590 A247139 A036591 * A036656 A001190 A274937

Adjacent sequences:  A036589 A036590 A036591 * A036593 A036594 A036595

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 24 04:27 EDT 2017. Contains 292403 sequences.