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.
A260383
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.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =36a(4) =15a(5) =6a(6) =2304a(7) =1280a(8) =704a(9) =384a(10) =250000a(11) =159375a(12) =101250a(13) =64125a(14) =40500a(15) =41990400a(16) =29113344a(17) =20155392a(18) =13934592a(19) =9621504a(20) =6635520a(21) =10169108964a(22) =7465417295a(23) =5476560950a(24) =4014772125a(25) =2941225000a(26) =2153396875a(27) =1575656250
External references
- oeis: A260383