A110100 - cp's OEIS frontend

A110100 a(n) is the number of 2-regular 3-hypergraphs on 3n labeled vertices. (In a 3-hypergraph, each hyper-edge is a proper 3-set; 2-regular implies that each vertex is in exactly 2 hyperedges.)

n	a(n)
0	1
1	0
2	75
3	122220
4	757275750
5	12713292692100
6	474415445827323000
7	34461884930947363890000
8	4431555785100983345799993000
9	939388724430508823324694340500000

[1, 0, 75, 122220, 757275750, 12713292692100, 474415445827323000, 34461884930947363890000, 4431555785100983345799993000, 939388724430508823324694340500000]

cp's OEIS Frontend

A110100 a(n) is the number of 2-regular 3-hypergraphs on 3n labeled vertices. (In a 3-hypergraph, each hyper-edge is a proper 3-set; 2-regular implies that each vertex is in exactly 2 hyperedges.)

Table of values

List of values