Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A036658
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A036658
Number of n-node rooted unlabeled trees with exactly 3 edges at root and otherwise out-degree <=2.
+0
3
0, 0, 0, 0, 1, 1, 3, 6, 14, 29, 68, 147, 337, 757, 1734, 3953, 9113, 20988, 48645, 112909, 263084, 614201, 1438001, 3373253, 7930660, 18679005, 44075988, 104173194, 246604137, 584620470, 1387879434, 3299067379, 7851736348
(
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 13 23:45 EST 2009. Contains 170824 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
