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!)
A045722 Number of border edges in all noncrossing rooted trees on n nodes. 2
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
FORMULA
a(n) = (n+1)*binomial(3n-2, n-1)/n for n >= 2. [Corrected by Sean A. Irvine, Mar 19 2021]
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
D-finite with recurrence 2*n*(2*n-1)*a(n) + (-43*n^2+83*n-34)*a(n-1) + 12*(3*n-5)*(3*n-7)*a(n-2) = 0. - R. J. Mathar, Jul 26 2022
a(n) = (n+1) * A006013(n-1) for n >= 2. - F. Chapoton, Feb 27 2024
MATHEMATICA
MapAt[# - 1 &, Array[(# + 1) Binomial[3 # - 2, # - 1]/# &, 21], 1] (* Michael De Vlieger, Mar 19 2021 *)
CROSSREFS
Sequence in context: A163029 A309490 A344755 * A047129 A173081 A278015
KEYWORD
nonn
AUTHOR
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 28 07:46 EDT 2024. Contains 372020 sequences. (Running on oeis4.)