id:A136796 - OEIS Search Results

Search: id:A136796

Displaying 1-1 of 1 results found.

page 1

Number of labeled marked rooted trees with n nodes.

+0
3

2, 16, 288, 8192, 320000, 15925248, 963780608, 68719476736, 5642219814912, 524288000000000, 54394721876836352, 6232805962420322304, 781754012972500385792, 106530593546206374264832 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`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, pg 293 (4.1.60)`
	LINKS	`Index entries for sequences related to rooted trees`
	FORMULA	`E.g.f.: B(4x)/2 where B(x) is e.g.f. of A000169. a(n)=A052764(n)2.`
	CROSSREFS	`Cf. A136794 (unlabeled version), A136797 (tree version).` `Sequence in context: A000182 A102599 A123744 this_sequence A055546 A009549 A009795` `Adjacent sequences: A136793 A136794 A136795 this_sequence A136797 A136798 A136799`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), Jan 21 2008`

page 1

Search completed in 0.002 seconds

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.

AT&T Labs Research