Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A036657
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A036657
Number of n-node rooted unlabeled trees with out-degree <=2 and exactly 2 edges at the root.
+0
3
0, 0, 0, 1, 1, 3, 5, 12, 23, 52, 109, 244, 532, 1196, 2671, 6055, 13726, 31380, 71901, 165635, 382610, 887215, 2062777, 4810230, 11243898, 26346341, 61863991, 145560102, 343121676, 810246372, 1916417479, 4539722153, 10769366928
(
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 7 23:50 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
