Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A032103
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A032103 Number of dyslexic identity planted planar trees with n+1 nodes and leaves of 2 colors. +0
1
2, 2, 3, 9, 32, 125, 489, 1971, 8057, 33582, 141854, 606967, 2623678, 11444588, 50306835, 222638649, 991173730, 4435974275, 19946529375, 90069370028, 408261634445, 1856940442884, 8472695323318 (list; graph; listen)
OFFSET

1,1
LINKS

Index entries for sequences related to rooted trees

FORMULA

Shifts left under "BHK" (reversible, identity, unlabeled) transform

CROSSREFS

Sequence in context: A021821 A019234 A032172 this_sequence A091044 A079661 A067579

Adjacent sequences: A032100 A032101 A032102 this_sequence A032104 A032105 A032106

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 August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research

Legal Notice
© 2007 AT&T Knowledge Ventures. All Rights Reserved.