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
)
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 21 10:15 EST 2009. Contains 171081 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
