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.

A274081 Number of unrooted labeled trees on 3n+2 nodes with node degree either one or four.

Original entry on oeis.org

1, 5, 560, 277200, 369969600, 1040623584000, 5318844410880000, 44743448895425280000, 577102758498249984000000, 10821132329283106871040000000, 283002122589833107696435200000000, 9986037506585076241055342592000000000, 462684151212030123561950840428953600000000
Offset: 0

Views

Author

Marko Riedel, Jun 09 2016

Keywords

Comments

There are no unrooted labeled trees on 3n or 3n+1 nodes with node degree either one or four.

Crossrefs

Programs

  • Maple
    seq(binomial(3*n+2, n)*(3*n)!/(3!^n), n=0..16);
  • Mathematica
    Table[Binomial[3*n+2, n]*(3*n)!/(3!)^n, {n,0,10}] (* G. C. Greubel, Jun 09 2016 *)