Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032102
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032102 Number of dyslexic identity rooted planar trees with n nodes. +0
1
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; listen)
OFFSET

1,4

LINKS

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 this_sequence A100388 A160181 A143874

Adjacent sequences: A032099 A032100 A032101 this_sequence A032103 A032104 A032105

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 December 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research