Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036599
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036599 Number of binary rooted trees with n nodes and height exactly 10. +0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 9, 44, 162, 509, 1446, 3835, 9687, 23612, 56026, 130192, 297562, 670942, 1495811, 3302564, 7230246, 15710344, 33906496, 72728133, 155120068, 329124137, 694925899, 1460623771, 3056894972, 6371896316 (list; graph; listen)
OFFSET

0,12

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

Adjacent sequences: A036596 A036597 A036598 this_sequence A036600 A036601 A036602

Sequence in context: A034194 A075206 A050486 this_sequence A059825 A074631 A084903

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research