login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 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; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..30.

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: A032048 A219226 A238426 * A107316 A124682 A079512

Adjacent sequences:  A032063 A032064 A032065 * A032067 A032068 A032069

KEYWORD

nonn

AUTHOR

Christian G. Bower

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified October 21 19:01 EDT 2014. Contains 248377 sequences.