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!)
A071212 Number of labeled cyclic trees with n nodes such that the root is smaller than all its children. 0
1, 4, 28, 286, 3848, 64198, 1277400, 29507784, 775826832, 22869156168, 746817076080, 26758697374176, 1043610018593088, 44007103062886416, 1994973101346054144, 96747604119630501120, 4997654990315699224320 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,2
REFERENCES
C. Chauve, S. Dulucq and O. Guibert, Enumeration of some labeled trees, research report RR-1226-99, LaBRI, Bordeaux I University, 1999.
LINKS
MAPLE
n -> sum((n! / (n-k)!) * (-1)^(n-1-k) * stirling1(n-1, k), k=0..n) - sum(((n-2)! / (n-1-k)!) * (-1)^(n-k) * stirling1(n, k), k=0..n-1);
CROSSREFS
Cf. A000312.
Sequence in context: A369088 A007559 A138208 * A090353 A360018 A360832
KEYWORD
easy,nonn
AUTHOR
Cedric Chauve (chauve(AT)lacim.uqam.ca), May 16 2002
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 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)