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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032102 Number of dyslexic identity rooted planar trees with n nodes. 0
1, 1, 1, 2, 3, 7, 18, 48, 133, 373, 1054, 3011, 8678, 25216, 73801, 217476, 644554, 1920718, 5750807, 17293653, 52208550, 158179651, 480806995, 1465841157, 4481166838, 13733815975, 42189399220, 129883408346 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

C. G. Bower, Transforms (2)

Index entries for sequences related to rooted trees

FORMULA

"DHK" (bracelet, identity, unlabeled) transform of A032101 (shifted right one place).

CROSSREFS

Sequence in context: A131093 A002864 A005248 * A100388 A186232 A160181

Adjacent sequences:  A032099 A032100 A032101 * A032103 A032104 A032105

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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 19 02:06 EST 2018. Contains 299330 sequences. (Running on oeis4.)