cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A055323 Number of labeled trees with n nodes and 11 leaves.

Original entry on oeis.org

12, 159588, 188972784, 82965682800, 21005730345600, 3748679961586560, 526390865228067840, 62217055603837854720, 6471318681640036224000, 610909570703009305728000, 53525038934303849706393600, 4425402761285129060851814400, 349680886000693821465783091200, 26668509525935198065515571200000
Offset: 12

Views

Author

Christian G. Bower, May 11 2000

Keywords

Crossrefs

Column 11 of A055314.

Programs

  • Magma
    [Factorial(n)*(n-11)^2*(n-10)^2*(n-9)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(15*n^6 - 825*n^5 + 18615*n^4 - 220127*n^3 + 1435578*n^2 - 4882792*n + 6746112) / 111244864389120000: n in [12..25]]; // Vincenzo Librandi, Jul 25 2014
  • Mathematica
    Table[n! * (n-11)^2*(n-10)^2*(n-9)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(15*n^6 - 825*n^5 + 18615*n^4 - 220127*n^3 + 1435578*n^2 - 4882792*n + 6746112) / 111244864389120000,{n,12,25}] (* Vaclav Kotesovec, Jul 25 2014 *)

Formula

a(n) = (n!/11!)*Stirling2(n-2, n-11). - Vladeta Jovovic, Jan 28 2004
a(n) = n! * (n-11)^2*(n-10)^2*(n-9)*(n-8)*(n-7)*(n-6)*(n-5)*(n-4)*(n-3)*(n-2)*(15*n^6 - 825*n^5 + 18615*n^4 - 220127*n^3 + 1435578*n^2 - 4882792*n + 6746112) / 111244864389120000. - Vaclav Kotesovec, Jul 25 2014