id:A052120 - OEIS Search Results

Search: id:A052120

Displaying 1-1 of 1 results found.

page 1

Number of 3-valent trees (= boron trees or binary trees) with n nodes.

+0
2

1, 1, 0, 1, 0, 1, 0, 1, 0, 2, 0, 2, 0, 4, 0, 6, 0, 11, 0, 18, 0, 37, 0, 66, 0, 135, 0, 265, 0, 552, 0, 1132, 0, 2410, 0, 5098, 0, 11020, 0, 23846, 0 (list; graph; listen)

	OFFSET	`1,10`
	COMMENT	`Trees with n nodes each of valency either 1 or 3.`
	LINKS	`Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.` `Index entries for sequences related to trees` `Eric Weisstein's World of Mathematics, Trivalent Tree`
	CROSSREFS	`See A000672, the subsequence of even-numbered terms, which is the main entry for this sequence, for more terms, references, etc.` `Sequence in context: A029187 A035385 A051629 this_sequence A029186 A072680 A067770` `Adjacent sequences: A052117 A052118 A052119 this_sequence A052121 A052122 A052123`
	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 14:49 EST 2009. Contains 167514 sequences.

AT&T Labs Research