Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136797 Number of labeled marked trees with n nodes. +0
3
2, 8, 96, 2048, 64000, 2654208, 137682944, 8589934592, 626913312768, 52428800000000, 4944974716076032, 519400496868360192, 60134924074807721984, 7609328110443312447488 (list; graph; listen)
OFFSET

1,1

COMMENT

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, pg 293 (4.1.60)

LINKS

Index entries for sequences related to trees

FORMULA

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

CROSSREFS

Sequence in context: A098272 A087540 A052713 this_sequence A009752 A137704 A001417

Adjacent sequences: A136794 A136795 A136796 this_sequence A136798 A136799 A136800

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research