login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005588 Number of free binary rooted trees of height n.
(Formerly M1813)
3
2, 7, 52, 2133, 2590407, 3374951541062, 5695183504479116640376509, 16217557574922386301420514191523784895639577710480, 131504586847961235687181874578063117114329409897550318273792033024340388219235081096658023517076950 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

F. Harary et al., Counting free binary trees..., J. Combin. Inform. System Sciences, 17 (1992), 175-181.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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 * A106898 A106899 A119772

Adjacent sequences:  A005585 A005586 A005587 * A005589 A005590 A005591

KEYWORD

nonn,easy,core,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.