Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036600
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036600 Number of binary rooted trees with n nodes and height exactly 11. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 10, 54, 217, 736, 2238, 6311, 16858, 43262, 107693, 261823, 624756, 1468489, 3409246, 7833514, 17841580, 40327947, 90547126, 202096457, 448654889, 991165733, 2179884354, 4774433308, 10416862098 (list; graph; listen)
OFFSET

0,13

LINKS

Index entries for sequences related to rooted trees

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.

CROSSREFS

Sequence in context: A093187 A152762 A053347 this_sequence A058645 A057586 A139610

Adjacent sequences: A036597 A036598 A036599 this_sequence A036601 A036602 A036603

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 24 19:42 EST 2009. Contains 167435 sequences.


AT&T Labs Research