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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A032129 Number of dyslexic rooted planar trees with n nodes. 0
1, 1, 2, 4, 9, 21, 55, 146, 413, 1194, 3553, 10756, 33134, 103273, 325484, 1034734, 3314870, 10688513, 34662777, 112976023, 369876832, 1215811262, 4010932603, 13275356936, 44070010202, 146698487202, 489550622528 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

LINKS

C. G. Bower, Transforms (2)

Index entries for sequences related to rooted trees

FORMULA

"DIK" (bracelet, indistinct, unlabeled) transform of A032128 (shifted right one place).

CROSSREFS

Sequence in context: A063026 A106219 A198304 * A005217 A148072 A001430

Adjacent sequences:  A032126 A032127 A032128 * A032130 A032131 A032132

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net)

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

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

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.