id:A029766 - OEIS Search Results

Search: id:A029766

Displaying 1-1 of 1 results found.

page 1

Unary-binary rooted trees with n nodes.

+0
1

0, 1, 2, 12, 48, 360, 2160, 25200, 201600, 2540160, 25401600, 399168000, 4790016000, 80951270400, 1133317785600, 23538138624000, 376610217984000, 8180810846208000, 147254595231744000, 3649353012264960000 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`A unary-binary tree is simply a tree in which every node has degree <= 3.`
	REFERENCES	`F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Camb. 1998, p. 254.`
	LINKS	`Index entries for sequences related to rooted trees`
	FORMULA	`E.g.f: (1-x-sqrt(1-2x-3x^2))/(2x).`
	CROSSREFS	`Sequence in context: A001815 A052569 A052591 this_sequence A088311 A052588 A139239` `Adjacent sequences: A029763 A029764 A029765 this_sequence A029767 A029768 A029769`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research