|
|
A068087
|
|
a(n) = n^(2*n-2).
|
|
6
|
|
|
1, 4, 81, 4096, 390625, 60466176, 13841287201, 4398046511104, 1853020188851841, 1000000000000000000, 672749994932560009201, 552061438912436417593344, 542800770374370512771595361, 629983141281877223603213172736, 852226929923929274082183837890625
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Number of spanning trees in the bipartite graph K(n,n). In general the number of spanning trees in the bipartite graph K(m,n) is m^(n-1) * n^(m-1).
|
|
LINKS
|
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Sharon Sela (sharonsela(AT)hotmail.com), May 06 2002
|
|
STATUS
|
approved
|
|
|
|