Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A036591
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A036591 Number of binary rooted trees with n nodes and height at most 8. +0
1
1, 1, 1, 2, 3, 6, 11, 23, 46, 97, 198, 406, 811, 1613, 3155, 6141, 11822, 22652, 43052, 81441, 153031, 286187, 532067, 984509, 1811933, 3319129, 6049533, 10975090, 19815546, 35613904, 63710026, 113457471, 201128376, 354949071 (list; graph; listen)
OFFSET

0,4

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: A123769 A093304 A036590 this_sequence A036592 A001190 A036656

Adjacent sequences: A036588 A036589 A036590 this_sequence A036592 A036593 A036594

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 December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research