A028446 Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}.

1, 9, 5051532105, 417898687046465734392674187695263185

Offset

0,2

References

Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.

Links

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

Per Hakan Lundow, Enumeration of matchings in polygraphs, 1998.

Steven Kotlarz, Rust Program

Steven Kotlarz, Details of calculation and code walkthrough

Prog

(Rust) // See Kotlarz links. Steven Kotlarz, Mar 29 2026

Crossrefs

Sequence in context: A225775 A154110 A235400 * A058470 A058434 A067487

Adjacent sequences: A028443 A028444 A028445 * A028447 A028448 A028449

Keyword

nonn,bref,more

Author

Per H. Lundow

Extensions

a(3) from Steven Kotlarz, Mar 29 2026

Status

approved