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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136796 Number of labeled marked rooted trees with n nodes. 2
2, 16, 288, 8192, 320000, 15925248, 963780608, 68719476736, 5642219814912, 524288000000000, 54394721876836352, 6232805962420322304, 781754012972500385792, 106530593546206374264832 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A marked rooted tree is a rooted 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, pg 293 (4.1.60)

LINKS

Index entries for sequences related to rooted trees

FORMULA

E.g.f.: B(4*x)/2 where B(x) is e.g.f. of A000169. a(n)=A052764(n)*2.

CROSSREFS

Cf. A136794 (unlabeled version), A136797 (tree version).

Sequence in context: A189257 A102599 A123744 * A055546 A009549 A009795

Adjacent sequences:  A136793 A136794 A136795 * A136797 A136798 A136799

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jan 21 2008

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 16 05:32 EST 2012. Contains 205860 sequences.