%I A136796
%S A136796 2,16,288,8192,320000,15925248,963780608,68719476736,5642219814912,
%T A136796 524288000000000,54394721876836352,6232805962420322304,
%U A136796 781754012972500385792,106530593546206374264832
%N A136796 Number of labeled marked rooted trees with n nodes.
%C A136796 A marked rooted tree is a rooted tree where each node and edge is marked 
               as + or -.
%D A136796 F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like 
               Structures, Cambridge, 1998, pg 293 (4.1.60)
%H A136796 <a href="Sindx_Ro.html#rooted">Index entries for sequences related to 
               rooted trees</a>
%F A136796 E.g.f.: B(4*x)/2 where B(x) is e.g.f. of A000169. a(n)=A052764(n)*2.
%Y A136796 Cf. A136794 (unlabeled version), A136797 (tree version).
%Y A136796 Sequence in context: A000182 A102599 A123744 this_sequence A055546 A009549 
               A009795
%Y A136796 Adjacent sequences: A136793 A136794 A136795 this_sequence A136797 A136798 
               A136799
%K A136796 nonn
%O A136796 1,1
%A A136796 Christian G. Bower (bowerc(AT)usa.net), Jan 21 2008