login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136797 Number of labeled marked trees with n nodes. 3
2, 8, 96, 2048, 64000, 2654208, 137682944, 8589934592, 626913312768, 52428800000000, 4944974716076032, 519400496868360192, 60134924074807721984, 7609328110443312447488, 1044855521280000000000000, 154742504910672534362390528, 24588026787102364507838611456 (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
FORMULA
a(n) = A136796(n)/n.
a(n) = 2^(2*n-1) * n^(n-2). - Andrew Howroyd, Feb 02 2020
PROG
(PARI) a(n) = {2^(2*n-1) * n^(n-2)} \\ Andrew Howroyd, Feb 02 2020
CROSSREFS
Cf. A136796.
Sequence in context: A098272 A087540 A052713 * A255132 A297332 A009752
KEYWORD
nonn
AUTHOR
Christian G. Bower, Jan 21 2008
EXTENSIONS
Terms a(15) and beyond from Andrew Howroyd, Feb 02 2020
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)