(MAGMAMagma) /* As triangle */ [[((n-2)*n+k)*(n-2)^(k-1)*n^(2*n-k-3): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Jul 24 2015
(MAGMAMagma) /* As triangle */ [[((n-2)*n+k)*(n-2)^(k-1)*n^(2*n-k-3): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Jul 24 2015
reviewed
approved
proposed
reviewed
editing
proposed
nonn,tabl
nonn,tabl
approved
editing
proposed
approved
editing
proposed
Tiangle Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.
proposed
editing
editing
proposed
0, 1, 0, 36, 15, 6, 2304, 1280, 704, 384, 250000, 159375, 101250, 64125, 40500, 41990400, 29113344, 20155392, 13934592, 9621504, 6635520, 10169108964, 7465417295, 5476560950, 4014772125, 2941225000, 2153396875, 1575656250, 3367254360064, 2576980377600
Join[{0, 1, 0}, t[n_, k_]:=((n - 2) n + k) (n - 2)^(k - 1) n^(2 n - k - 3); Table[t[n, k], {n, 3, 10}, {k, n}]//Flatten] (* Vincenzo Librandi, Jul 24 2015 *)
(MAGMA) /* As triangle */ [[((n-2)*n+k)*(n-2)^(k-1)*n^(2*n-k-3): k in [1..n]]: n in [1.. 15]]; // Vincenzo Librandi, Jul 24 2015
proposed
editing