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
)
page 1
Search completed in 0.003 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 27 14:50 EST 2009. Contains 167570 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
