|
| |
| |
|
|
|
0, 1, 12, 156, 2360, 41400, 831012, 18832576, 476200944, 13301078400, 406907517500, 13534968927744, 486470108273448, 18790567023993856, 776343673316956500, 34165751933338828800, 1595693034061797583328, 78831769938218360930304
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| This is Sum_{all n^(n-2) labeled trees T on n nodes} Sum_{1<=i<j<=n} distance(node i, node j).
|
|
|
REFERENCES
| Winkler, Peter, Mean distance in a tree. In Computational algorithms, operations research and computer science (Burnaby, BC, 1987). Discrete Appl. Math. 27 (1990), no. 1-2, 179-185. [For background information only.]
|
|
|
LINKS
| J. Riordan and N. J. A. Sloane, Enumeration of rooted trees by total height, J. Austral. Math. Soc., vol. 10 pp. 278-282, 1969.
|
|
|
CROSSREFS
| Sequence in context: A097259 A158546 A110216 * A003130 A015000 A112719
Adjacent sequences: A036273 A036274 A036275 * A036277 A036278 A036279
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
