login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136797 Number of labeled marked trees with n nodes. 2
2, 8, 96, 2048, 64000, 2654208, 137682944, 8589934592, 626913312768, 52428800000000, 4944974716076032, 519400496868360192, 60134924074807721984, 7609328110443312447488 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A marked tree is a tree where each node and edge is marked as + or -.

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 293 (4.1.60).

LINKS

Table of n, a(n) for n=1..14.

Index entries for sequences related to trees

FORMULA

a(n) = A136796(n)/n.

CROSSREFS

Sequence in context: A098272 A087540 A052713 * A255132 A297332 A009752

Adjacent sequences:  A136794 A136795 A136796 * A136798 A136799 A136800

KEYWORD

nonn

AUTHOR

Christian G. Bower, Jan 21 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 08:18 EST 2020. Contains 331081 sequences. (Running on oeis4.)