Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with k edges and all vertices having even degree, 0 <= k < 2^n.
A340030
Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with k edges and all vertices having even degree, 0 <= k < 2^n.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =0a(6) =1a(7) =1a(8) =0a(9) =0a(10) =7a(11) =7a(12) =0a(13) =0a(14) =1a(15) =1a(16) =0a(17) =0a(18) =35a(19) =105a(20) =168a(21) =280a(22) =435a(23) =435a(24) =280a(25) =168a(26) =105a(27) =35a(28) =0a(29) =0
External references
- oeis: A340030