Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A000485
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A000485
Partially labeled trees with n nodes (4 of which are labeled).
(Formerly M5008 N2156)
+0
9
16, 125, 680, 3135, 13155, 51873, 195821, 715614, 2550577, 8911942, 30640888, 103951415, 348724844, 1158722880, 3818514232, 12493703403, 40620949971, 131336770375, 422536529249, 1353341880777, 4317248276746, 13722302173753
(
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 November 29 12:46 EST 2009. Contains 167659 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.