Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A036601
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A036601
Number of binary rooted trees with n nodes and height exactly 12.
+0
1
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 11, 65, 283, 1030, 3335, 9952, 27987, 75287, 195752, 495613, 1228577, 2994065, 7195616, 17094566, 40219347, 93848187, 217433025, 500640356, 1146414797, 2612325990, 5926402180, 13390758445
(
list
;
graph
;
listen
)
page 1
Search completed in 0.001 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 6 13:45 EST 2009. Contains 170429 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
