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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036591 Number of binary rooted trees with n nodes and height at most 8. 2
1, 1, 1, 2, 3, 6, 11, 23, 46, 97, 198, 406, 811, 1613, 3155, 6141, 11822, 22652, 43052, 81441, 153031, 286187, 532067, 984509, 1811933, 3319129, 6049533, 10975090, 19815546, 35613904, 63710026, 113457471, 201128376, 354949071 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

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

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: A093304 A036590 A247139 * A036592 A036656 A001190

Adjacent sequences:  A036588 A036589 A036590 * A036592 A036593 A036594

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:14 EDT 2017. Contains 292402 sequences.