login
A338279
Number of 3-uniform 2-regular hypergraphs on 3n unlabeled nodes.
0
0, 2, 6, 23, 103, 574
OFFSET
1,2
COMMENTS
A 2-regular 3-uniform hypergraph on v vertices can exist only if v is a multiple of 3. The initial terms were generated by using the nauty function in SageMath.
PROG
(Sage) Set(list(hypergraphs.nauty(#edges, #vertices, uniform=3, regular=2))).cardinality()
CROSSREFS
Sequence in context: A263778 A352854 A053488 * A117106 A137534 A137535
KEYWORD
nonn,more
AUTHOR
Saad El-Zanati, Oct 20 2020
STATUS
approved