Number of connected (3,n)-hypergraphs (without empty edges and without multiple edges).
A114932
Number of connected (3,n)-hypergraphs (without empty edges and without multiple edges).
Terms
- a(0) =0a(1) =0a(2) =1a(3) =25a(4) =267a(5) =2265a(6) =17471a(7) =128765a(8) =927067a(9) =6591505a(10) =46545591a(11) =327428805a(12) =2298406067a(13) =16114352345a(14) =112902172111a(15) =790721005645
External references
- oeis: A114932