Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036598
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036598 Number of binary rooted trees with n nodes and height exactly 9. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 8, 35, 117, 338, 891, 2208, 5240, 12051, 27060, 59630, 129389, 277146, 586953, 1230801, 2557766, 5272384, 10786683, 21916364, 44242295, 88774290, 177117257, 351481202, 693942477, 1363437316, 2666412440 (list; graph; listen)
OFFSET

0,11

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: A006600 A005732 A040977 this_sequence A059824 A094616 A114569

Adjacent sequences: A036595 A036596 A036597 this_sequence A036599 A036600 A036601

KEYWORD

nonn,fini

AUTHOR

njas

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research