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.

A274056 Number of unrooted labeled trees on 2n nodes with node degree either one or three.

Original entry on oeis.org

1, 4, 90, 5040, 529200, 89812800, 22475653200, 7791559776000, 3576325937184000, 2100278686746240000, 1536353859354874560000, 1369954918280131223040000, 1462916144877711556032000000, 1843274342545916560600320000000, 2706157144150223750531344800000000
Offset: 1

Views

Author

Marko Riedel, Jun 08 2016

Keywords

Comments

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

Crossrefs

Cf. A000272.

Programs

  • Maple
    seq(binomial(2*n, (2*n-2)/2)*(2*n-2)!/2^((2*n-2)/2), n=1..16);