login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A045722 Number of border edges in all noncrossing rooted trees on n nodes. 1
1, 6, 28, 150, 858, 5096, 31008, 191862, 1201750, 7597590, 48384180, 309939240, 1994981688, 12892738800, 83604224384, 543722433078, 3545056580814, 23164787710610, 151662849838500, 994674967479270, 6533629880128890 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..21.

Index entries for sequences related to rooted trees

FORMULA

a(n) = n*binomial(3n-5, n-2)/(n-1) for n >= 2.

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

CROSSREFS

Cf. A026004.

Sequence in context: A110047 A163029 A309490 * A047129 A173081 A278015

Adjacent sequences:  A045719 A045720 A045721 * A045723 A045724 A045725

KEYWORD

nonn

AUTHOR

Emeric Deutsch

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 16:56 EDT 2020. Contains 336381 sequences. (Running on oeis4.)