A338279 Number of 3-uniform 2-regular hypergraphs on 3n unlabeled nodes.

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.

Links

Table of n, a(n) for n=1..6.

Prog

(Sage) Set(list(hypergraphs.nauty(#edges, #vertices, uniform=3, regular=2))).cardinality()

Crossrefs

Sequence in context: A263778 A352854 A053488 * A117106 A137534 A137535

Adjacent sequences: A338276 A338277 A338278 * A338280 A338281 A338282

Keyword

nonn,more

Author

Saad El-Zanati, Oct 20 2020

Status

approved