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!)
A055320 Number of labeled trees with n nodes and 8 leaves. 1

%I #17 Sep 08 2022 08:45:01

%S 9,11430,2994750,405167400,38104981200,2861947408320,185364917337600,

%T 10851787634688000,592181546628672000,30766166997261696000,

%U 1544883657843618892800,75806672148355180032000

%N Number of labeled trees with n nodes and 8 leaves.

%H Vincenzo Librandi, <a href="/A055320/b055320.txt">Table of n, a(n) for n = 9..200</a>

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

%F (n!/8!)*Stirling2(n-2, n-8). - _Vladeta Jovovic_, Jan 28 2004

%F a(n) = n! * (n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(63*n^5 - 2205*n^4 + 30555*n^3 - 209251*n^2 + 707014*n - 940896)/117050572800. - _Vaclav Kotesovec_, Jul 25 2014

%t Table[n! * (n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(63*n^5 - 2205*n^4 + 30555*n^3 - 209251*n^2 + 707014*n - 940896)/117050572800,{n,9,20}] (* _Vaclav Kotesovec_, Jul 25 2014 *)

%o (Magma) [Factorial(n)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(63*n^5 - 2205*n^4 + 30555*n^3 - 209251*n^2 + 707014*n - 940896)/117050572800: n in [9..25]]; // _Vincenzo Librandi_, Jul 25 2014

%Y Column 8 of A055314.

%K nonn

%O 9,1

%A _Christian G. Bower_, May 11 2000

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 July 22 18:05 EDT 2024. Contains 374540 sequences. (Running on oeis4.)