Number of minimal edge cuts in the complete bipartite graph K_{n,n}.
A379215
Number of minimal edge cuts in the complete bipartite graph K_{n,n}.
Terms
- a(0) =1a(1) =6a(2) =24a(3) =106a(4) =460a(5) =1934a(6) =7952a(7) =32274a(8) =130068a(9) =522262a(10) =2093080a(11) =8380442a(12) =33538076a(13) =134184990a(14) =536805408a(15) =2147352610a(16) =8589672484a(17) =34359214118a(18) =137437904936a(19) =549753716778
External references
- oeis: A379215