Array read by antidiagonals: T(n,m) is the number of acyclic edge covers of the complete bipartite graph K_{n,m}.
A328888
Array read by antidiagonals: T(n,m) is the number of acyclic edge covers of the complete bipartite graph K_{n,m}.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =6a(5) =1a(6) =1a(7) =18a(8) =18a(9) =1a(10) =1a(11) =46a(12) =132a(13) =46a(14) =1a(15) =1a(16) =110a(17) =696a(18) =696a(19) =110a(20) =1a(21) =1a(22) =254a(23) =3150a(24) =6728a(25) =3150a(26) =254a(27) =1a(28) =1a(29) =574
External references
- oeis: A328888