Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A000169
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A000169
Number of labeled rooted trees with n nodes: n^(n-1).
(Formerly M1946 N0771)
+0
108
1, 2, 9, 64, 625, 7776, 117649, 2097152, 43046721, 1000000000, 25937424601, 743008370688, 23298085122481, 793714773254144, 29192926025390625, 1152921504606846976, 48661191875666868481, 2185911559738696531968
(
list
;
graph
;
listen
)
page 1
Search completed in 0.003 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 25 20:09 EST 2009. Contains 167514 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
