A395234 Number of cycles in K_{2n,2n,2n} minus a perfect matching.

14, 476075, 364593585387

Offset

1,1

Comments

Here cycles means simple cycles.

Regardless of which perfect matching is removed, the resulting graph is the same up to isomorphism.

Links

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

Eric Weisstein's World of Mathematics, Complete Tripartite Graph Minus Perfect Matching.

Eric Weisstein's World of Mathematics, Graph Cycle.

Example

a(1) = 14, since K_{2,2,2} minus a perfect matching is the 3-prism graph, which has 14 cycles.

Crossrefs

Cf. A393180 (perfect matchings in the same graph).

Cf. A393586 (Hamiltonian cycles in the same graph).

Sequence in context: A164322 A372084 A159430 * A013800 A368692 A350891

Adjacent sequences: A395231 A395232 A395233 * A395235 A395236 A395237

Keyword

nonn,more,bref

Author

Eric W. Weisstein, Jun 01 2026

Status

approved