|
Search: id:A068087
|
|
| |
|
| 1, 4, 81, 4096, 390625, 60466176, 13841287201, 4398046511104, 1853020188851841, 1000000000000000000, 672749994932560009201, 552061438912436417593344, 542800770374370512771595361, 629983141281877223603213172736, 852226929923929274082183837890625
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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).
|
|
MAPLE
|
a:=n->mul(n^2, k=2..n):seq(a(n), n=1..15); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 26 2008
|
|
CROSSREFS
|
a(n) = A000169(n)^2.
Cf. A069996, A001787, A072590.
Adjacent sequences: A068084 A068085 A068086 this_sequence A068088 A068089 A068090
Sequence in context: A041189 A123198 A128911 this_sequence A090599 A133396 A007154
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Sharon Sela (sharonsela(AT)hotmail.com), May 06 2002
|
|
|
Search completed in 0.002 seconds
|
