id:A032048 - OEIS Search Results

Search: id:A032048

Displaying 1-1 of 1 results found.

page 1

A032048

Number of dyslexic rooted planar trees with n nodes where any 2 subtrees extending from a node are of different sizes.

+0
1

1, 1, 1, 2, 3, 6, 13, 29, 64, 148, 355, 857, 2100, 5198, 12960, 32701, 82826, 211352, 541832, 1397654, 3614607, 9402256, 24500619, 64134061, 168178732, 442710004, 1166705391, 3085691999, 8168951368, 21689446136 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`C. G. Bower, Transforms (2)` `Index entries for sequences related to rooted trees`
	FORMULA	`"CFK" (necklace, size, unlabeled) transform of A032048 (shifted right one place).`
	CROSSREFS	`Sequence in context: A032160 A089735 A000646 this_sequence A032066 A107316 A124682` `Adjacent sequences: A032045 A032046 A032047 this_sequence A032049 A032050 A032051`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research