Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A045722
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A045722 Number of border edges in all noncrossing rooted trees on n nodes. +0
2
1, 6, 28, 150, 858, 5096, 31008, 191862, 1201750, 7597590, 48384180, 309939240, 1994981688, 12892738800, 83604224384, 543722433078, 3545056580814, 23164787710610, 151662849838500, 994674967479270, 6533629880128890 (list; graph; listen)
OFFSET

1,2

LINKS

Index entries for sequences related to rooted trees

FORMULA

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

CROSSREFS

Cf. A026004.

Sequence in context: A053783 A110047 A163029 this_sequence A047129 A052395 A034660

Adjacent sequences: A045719 A045720 A045721 this_sequence A045723 A045724 A045725

KEYWORD

nonn

AUTHOR

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

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research