|
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, 13150458684796123568718187457806311711432940989755031827379203302434038821923508\ 1096658023517076950
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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
David Wasserman, Table of n, a(n) for n = 1..21
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.
Sequence in context: A138737 A046662 A118191 this_sequence A106898 A106899 A119772
Adjacent sequences: A005585 A005586 A005587 this_sequence A005589 A005590 A005591
|
|
KEYWORD
|
nonn,easy,core,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
