login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136794 Number of unlabeled marked rooted trees with n nodes. 3

%I

%S 2,8,52,376,2998,25256,222128,2013680,18691522,176743160,1696546848,

%T 16488151400,161919802562,1604274741608,16016845623764,

%U 160977882238968,1627406260427490,16537733701226936

%N Number of unlabeled marked rooted trees with n nodes.

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

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

%H L. Foissy, <a href="https://arxiv.org/abs/1811.07572">Algebraic structures on typed decorated rooted trees</a>, arXiv:1811.07572 (2018)

%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>

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

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

%K nonn

%O 1,1

%A _Christian G. Bower_, Jan 21 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 15:37 EST 2020. Contains 331049 sequences. (Running on oeis4.)