a(n) is the number of 3-regular 3-hypergraphs on n labeled vertices. (In a 3-hypergraph, each hyper-edge is a proper 3-set; 3-regular implies that each vertex is in exactly 3 hyperedges.)
A110101
a(n) is the number of 3-regular 3-hypergraphs on n labeled vertices. (In a 3-hypergraph, each hyper-edge is a proper 3-set; 3-regular implies that each vertex is in exactly 3 hyperedges.)
Terms
- a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =12a(6) =330a(7) =11205a(8) =505505a(9) =28787052a(10) =2024844444a(11) =172592502570
External references
- oeis: A110101