Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.

A072590

Table T(n,k) giving number of spanning trees in complete bipartite graph K(n,k), read by antidiagonals.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =12a(8) =12a(9) =1a(10) =1a(11) =32a(12) =81a(13) =32a(14) =1a(15) =1a(16) =80a(17) =432a(18) =432a(19) =80a(20) =1a(21) =1a(22) =192a(23) =2025a(24) =4096a(25) =2025a(26) =192a(27) =1a(28) =1a(29) =448

External references