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.

A136794 Number of unlabeled marked rooted trees with n nodes.

Original entry on oeis.org

2, 8, 52, 376, 2998, 25256, 222128, 2013680, 18691522, 176743160, 1696546848, 16488151400, 161919802562, 1604274741608, 16016845623764, 160977882238968, 1627406260427490, 16537733701226936
Offset: 1

Views

Author

Christian G. Bower, Jan 21 2008

Keywords

Comments

A marked rooted tree is a rooted tree where each node and edge is marked as + or -.

References

  • F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 293 (4.1.60).

Crossrefs

Cf. A136795 (tree version), A136796 (labeled version).

Formula

a(n) = A136793(n)/2 = A052763(n)*2.