A136797 -id:A136797 - cp's OEIS frontend

A136796 Number of labeled marked rooted trees with n nodes.

2, 16, 288, 8192, 320000, 15925248, 963780608, 68719476736, 5642219814912, 524288000000000, 54394721876836352, 6232805962420322304, 781754012972500385792, 106530593546206374264832, 15672832819200000000000000, 2475880078570760549798248448

Offset: 1

Christian G. Bower, Jan 21 2008

nonn

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

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

Vincenzo Librandi, Table of n, a(n) for n = 1..200
Index entries for sequences related to rooted trees

Cf. A136794 (unlabeled version), A136797 (tree version).

[2^(2*n-1)*n^(n-1): n in [1..20]]; // Vincenzo Librandi, Mar 29 2014

Table[2^(2*n-1)*n^(n-1),{n,1,20}] (* Vaclav Kotesovec, Mar 29 2014 *)

E.g.f.: B(4*x)/2 where B(x) is e.g.f. of A000169.
a(n) = A052764(n)*2.
a(n) = 2^(2*n-1) * n^(n-1). - Vaclav Kotesovec, Mar 29 2014

More terms from Vincenzo Librandi, Mar 29 2014

A136795 Number of unlabeled marked trees with n nodes.

Original entry on oeis.org

2, 6, 20, 112, 662, 4596, 34032, 268280, 2201634, 18679362, 162611904, 1446148032, 13090979394, 120303384120, 1119971272340, 10544483234056, 100261309326082, 961692928106614, 9296529143261548, 90497666895840376

Offset: 1

Christian G. Bower, Jan 21 2008

nonn

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

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

Index entries for sequences related to trees

Cf. A136794 (rooted tree version), A136797 (labeled version).

G.f.: B(x) - B(x)^2 + B(x^2) where B(x) is g.f. of A136794.

cp's OEIS Frontend

A136796 Number of labeled marked rooted trees with n nodes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Mathematica

Formula

Extensions