This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055305 Number of labeled rooted trees with n nodes and 4 leaves. 1
 5, 450, 18900, 588000, 15876000, 400075200, 9779616000, 237105792000, 5779453680000, 142845262560000, 3599700616512000, 92818726640640000, 2454539660052480000, 66664716210892800000, 1861170036255129600000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 5..200 FORMULA a(n) = n! * (n-4)^2*(n-3)^2*(n-2)*(n-1)/1152. - Vaclav Kotesovec, Jul 25 2014 MATHEMATICA Table[n! * (n-4)^2*(n-3)^2*(n-2)*(n-1)/1152, {n, 5, 20}] (* Vaclav Kotesovec, Jul 25 2014 *) PROG (MAGMA) [Factorial(n)*(n-4)^2*(n-3)^2*(n-2)*(n-1)/1152 : n in [5..25]]; // Vincenzo Librandi, Jul 25 2014 CROSSREFS Column 4 of A055302. Sequence in context: A212042 A177026 A300544 * A300971 A300928 A221626 Adjacent sequences:  A055302 A055303 A055304 * A055306 A055307 A055308 KEYWORD nonn AUTHOR Christian G. Bower, May 11 2000 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.

Last modified December 16 06:18 EST 2019. Contains 330016 sequences. (Running on oeis4.)