Triangle read by rows: T(n,k) (1 <= k <= n) = number of irreducible coverings by edges of the complete bipartite graph K_{n,k}.
A210654
Triangle read by rows: T(n,k) (1 <= k <= n) = number of irreducible coverings by edges of the complete bipartite graph K_{n,k}.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =6a(5) =15a(6) =1a(7) =14a(8) =48a(9) =184a(10) =1a(11) =30a(12) =165a(13) =680a(14) =2945a(15) =1a(16) =62a(17) =558a(18) =2664a(19) =13080a(20) =63756a(21) =1a(22) =126a(23) =1827a(24) =11032a(25) =59605a(26) =320292a(27) =1748803a(28) =1a(29) =254
External references
- oeis: A210654