Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A032065
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A032065
Number of dyslexic planted planar trees with n+1 nodes where any 2 subtrees extending from the same node are different.
+0
2
1, 1, 1, 2, 3, 6, 14, 31, 70, 163, 407, 984, 2445, 6089, 15412, 39189, 100217, 257720, 666068, 1729169, 4505362, 11784473, 30917383, 81358804, 214658044, 567792612, 1505281859, 3999183421, 10645793860
(
list
;
graph
;
listen
)
page 1
Search completed in 0.001 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 18 21:37 EST 2009. Contains 171024 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
