login

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”).

A274056
Number of unrooted labeled trees on 2n nodes with node degree either one or three.
3
1, 4, 90, 5040, 529200, 89812800, 22475653200, 7791559776000, 3576325937184000, 2100278686746240000, 1536353859354874560000, 1369954918280131223040000, 1462916144877711556032000000, 1843274342545916560600320000000, 2706157144150223750531344800000000
OFFSET
1,2
COMMENTS
There are no unrooted labeled trees on 2n+1 nodes with node degree either one or three.
LINKS
Math.Stackexchange.com, Marko Riedel et al., Number of labeled trees
MAPLE
seq(binomial(2*n, (2*n-2)/2)*(2*n-2)!/2^((2*n-2)/2), n=1..16);
CROSSREFS
Cf. A000272.
Sequence in context: A240379 A304190 A362603 * A339987 A202918 A146506
KEYWORD
nonn
AUTHOR
Marko Riedel, Jun 08 2016
STATUS
approved