Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A075533
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A075533
Number of labeled rooted trees where each node at height h has 0 or h+1 children.
+0
3
1, 2, 0, 12, 0, 0, 840, 0, 0, 50400, 831600, 0, 0, 302702400, 1135134000, 14529715200, 0, 2315673360000, 15545887156800, 140792940288000, 443497761907200, 28006062372288000, 623360743125120000
(
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 13 23:45 EST 2009. Contains 170824 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
