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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A030983 Number of rooted noncrossing trees with n nodes such that root has degree 1 and the child of the root has degree at least 2. 1
0, 3, 16, 83, 442, 2420, 13566, 77539, 450340, 2650635, 15777450, 94815732, 574518536, 3506232184, 21533144486, 132980242755, 825304177544, 5144743785545, 32199189658020, 202252227085755, 1274578959894450 (list; graph; refs; listen; history; internal format)
OFFSET

3,2

REFERENCES

M. Noy, Enumeration of noncrossing trees on a circle, Discr. Math. 180 (1998), 301-313.

LINKS

Index entries for sequences related to rooted trees

FORMULA

(19*n-31)*binomial(3*n-8, n-4)/(n-1)/(2*n-3); G.f.: (1-2*z)*2*sin(arcsin(sqrt(27*z)/2)/3)/sqrt(3*z).

G.f.: g^3*(3-2*g) where g*(1-g)^2 = x - Mark van Hoeij, Nov 09 2011

CROSSREFS

Row 1 of A102892.

Sequence in context: A164100 A041707 A037584 * A069429 A026131 A026160

Adjacent sequences:  A030980 A030981 A030982 * A030984 A030985 A030986

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu)

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 15 15:20 EST 2012. Contains 205823 sequences.