A055310 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A055310

Number of labeled rooted trees with n nodes and 9 leaves.

10, 56210, 37621320, 10493357160, 1803842280240, 228599313742800, 23567044281580800, 2099312576058297600, 168119161594140556800, 12440787291129176179200, 867641306901247726848000

(list; graph; refs; listen; history; text; internal format)

OFFSET

10,1

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 10..200

Index entries for sequences related to rooted trees

FORMULA

a(n) = n! * (n-9)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(n-1)*(135*n^7 - 7245*n^6 + 164745*n^5 - 2054535*n^4 + 15148840*n^3 - 65892420*n^2 + 156108464*n - 154828800)/505658474496000. - Vaclav Kotesovec, Jul 25 2014

MATHEMATICA

Table[n! * (n-9)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(n-1)*(135*n^7 - 7245*n^6 + 164745*n^5 - 2054535*n^4 + 15148840*n^3 - 65892420*n^2 + 156108464*n - 154828800)/505658474496000, {n, 10, 20}] (* Vaclav Kotesovec, Jul 25 2014 *)

PROG

(Magma) [Factorial(n)*(n-9)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(n-1)*(135*n^7 - 7245*n^6 + 164745*n^5 - 2054535*n^4 + 15148840*n^3 - 65892420*n^2 + 156108464*n - 154828800)/505658474496000: n in [10..25]]; // Vincenzo Librandi, Jul 25 2014

CROSSREFS

Column 9 of A055302.

Sequence in context: A048916 A366313 A260797 * A371644 A048832 A225070

Adjacent sequences: A055307 A055308 A055309 * A055311 A055312 A055313

KEYWORD

nonn

AUTHOR

Christian G. Bower, May 11 2000

STATUS

approved