Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032129
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032129 Number of dyslexic rooted planar trees with n nodes. +0
1
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; listen)
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: A084261 A063026 A106219 this_sequence A005217 A001430 A057513

Adjacent sequences: A032126 A032127 A032128 this_sequence A032130 A032131 A032132

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research