Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071214
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071214 Number of labeled ordered trees with n nodes such that the root is smaller than all its children. +0
1
1, 5, 46, 614, 10716, 230712, 5903472, 174942000, 5890370400, 222069752640, 9265980286080, 423888544154880, 21094789126924800, 1134492559101619200, 65567415318776985600, 4052502049455940147200, 266725354163752808755200 (list; graph; listen)
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.

MAPLE

n -> ((2*n-2)! / (n-1)!) - sum((n+k-1)! / ((n-k-1)*k!), k=0 .. n-2);

CROSSREFS

Cf. A000312.

Sequence in context: A112029 A058478 A121631 this_sequence A052873 A052894 A066998

Adjacent sequences: A071211 A071212 A071213 this_sequence A071215 A071216 A071217

KEYWORD

easy,nonn

AUTHOR

Cedric Chauve (chauve(AT)lacim.uqam.ca), May 16 2002

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research