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!)
 A055316 Number of labeled trees with n nodes and 4 leaves. 1
 5, 210, 5250, 109200, 2116800, 40219200, 768398400, 14968800000, 299675376000, 6193291104000, 132456516192000, 2935293064704000, 67432408243200000, 1605928737853440000, 39636028549877760000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 5..200 FORMULA (n!/4!)*stirling2(n-2, n-4). - Vladeta Jovovic, Jan 28 2004 a(n) = n! * (n-4)*(n-3)*(n-2)*(3*n-11)/576. - Vaclav Kotesovec, Jul 25 2014 MATHEMATICA Table[n! * (n-4)*(n-3)*(n-2)*(3*n-11)/576, {n, 5, 20}] (* Vaclav Kotesovec, Jul 25 2014 *) PROG (MAGMA) [Factorial(n)*(n-4)*(n-3)*(n-2)*(3*n-11)/576: n in [5..25]]; // Vincenzo Librandi, Jul 25 2014 CROSSREFS Column 4 of A055314. Sequence in context: A144139 A020541 A006413 * A203470 A165208 A293652 Adjacent sequences:  A055313 A055314 A055315 * A055317 A055318 A055319 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 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)