Regular triangle read by rows where T(n,k) is the number of k-uniform hypergraphs spanning n labeled vertices where every two vertices appear together in some edge, n >= 0, 0 <= k <= n.
A320606
Regular triangle read by rows where T(n,k) is the number of k-uniform hypergraphs spanning n labeled vertices where every two vertices appear together in some edge, n >= 0, 0 <= k <= n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =1a(9) =1a(10) =0a(11) =0a(12) =1a(13) =5a(14) =1a(15) =0a(16) =0a(17) =1a(18) =388a(19) =16a(20) =1a(21) =0a(22) =0a(23) =1a(24) =477965a(25) =27626a(26) =42a(27) =1
External references
- oeis: A320606