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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A036597 Number of binary rooted trees with n nodes and height exactly 8. 0
0, 0, 0, 0, 0, 0, 0, 0, 1, 7, 27, 81, 213, 516, 1183, 2610, 5597, 11737, 24154, 48934, 97729, 192777, 375859, 725259, 1385706, 2623894, 4925791, 9173476, 16952955, 31103472, 56666571, 102552641, 184396932, 329502786, 585240171, 1033392428 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,10

LINKS

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

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: A267169 A266761 A027180 * A038092 A059823 A059769

Adjacent sequences:  A036594 A036595 A036596 * A036598 A036599 A036600

KEYWORD

nonn,fini

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 August 23 01:14 EDT 2017. Contains 290953 sequences.