id:A032066 - OEIS Search Results

Search: id:A032066

Displaying 1-1 of 1 results found.

page 1

A032066

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

+0
1

1, 1, 1, 2, 3, 6, 13, 29, 65, 151, 365, 887, 2185, 5426, 13636, 34529, 88017, 225621, 581461, 1505490, 3913987, 10214576, 26748565, 70263410, 185089117, 488842459, 1294194744, 3433966729, 9130325683, 24322504467 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`C. G. Bower, Transforms (2)` `Index entries for sequences related to rooted trees`
	FORMULA	`"CGK" (necklace, elements, unlabeled) transform of A032065 (shifted right one place).`
	CROSSREFS	`Sequence in context: A089735 A000646 A032048 this_sequence A107316 A124682 A079512` `Adjacent sequences: A032063 A032064 A032065 this_sequence A032067 A032068 A032069`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net)`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research