Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036597
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036597 Number of binary rooted trees with n nodes and height exactly 8. +0
1
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; listen)
OFFSET

0,10

LINKS

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: A039623 A005585 A027180 this_sequence A038092 A059823 A059769

Adjacent sequences: A036594 A036595 A036596 this_sequence A036598 A036599 A036600

KEYWORD

nonn,fini

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research