|
Search: id:A005588
|
|
|
| A005588 |
|
Number of free binary rooted trees of height n.
(Formerly M1813)
|
|
+0
2
|
|
| 2, 7, 52, 2133, 2590407, 3374951541062, 5695183504479116640376509, 16217557574922386301420514191523784895639577710480
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
F. Harary et al., Counting free binary trees..., J. Combin. Inform. System Sciences, 17 (1992), 175-181.
|
|
LINKS
|
David Wasserman, Table of n, a(n) for n = 1..12
Index entries for sequences related to rooted trees
Index entries for sequences related to trees
Index entries for "core" sequences
|
|
FORMULA
|
Reference gives a complicated recurrence.
|
|
CROSSREFS
|
Cf. A002658, A006894.
Adjacent sequences: A005585 A005586 A005587 this_sequence A005589 A005590 A005591
Sequence in context: A138737 A046662 A118191 this_sequence A106898 A106899 A119772
|
|
KEYWORD
|
nonn,easy,core,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
