|
Search: id:A071720
|
|
|
| A071720 |
|
Number of spanning trees in K_{n}-e, the complete graph on n nodes minus an edge (n>1). |
|
+0
1
|
|
| 0, 1, 8, 75, 864, 12005, 196608, 3720087, 80000000, 1929229929, 51597803520, 1516443410339, 48594782035968, 1686702392578125, 63050394783186944, 2525667398391013935, 107946249863639334912, 4903504030649559850577
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
REFERENCES
|
N. Eaton, W. Kook and L.Thoma, "Monotonicity for complete graphs", preprint
|
|
FORMULA
|
a(n)=(n-2)*n^{n-3} (n>1)
|
|
EXAMPLE
|
a(3)=1 because K_{3}-e is a tree.
|
|
MATHEMATICA
|
f[n_] := (n-2)*n^{n-3}; Table[f[i], {i, 20}]
|
|
CROSSREFS
|
Sequence in context: A145600 A094735 A067306 this_sequence A111685 A088376 A096293
Adjacent sequences: A071717 A071718 A071719 this_sequence A071721 A071722 A071723
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. Eaton, W. Kook, L. Thoma (andrewk(AT)math.uri.edu), Jan 16 2004
|
|
|
Search completed in 0.002 seconds
|
