A028461 Number of perfect matchings in graph P_{3} X C_{4} X P_{n}.

1, 32, 6345, 862112, 127027769, 18434590176, 2684514068049, 390673621254528, 56862963807949489, 8276224228029314656, 1204586814571431439961, 175324813971551693097120, 25518128187364758678417065, 3714105333409502557299108768, 540579565559752815170611323297

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

Alois P. Heinz, Table of n, a(n) for n = 0..200

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

Crossrefs

Sequence in context: A265371 A232913 A209542 * A240446 A221608 A283922

Adjacent sequences: A028458 A028459 A028460 * A028462 A028463 A028464

Keyword

nonn

Author

Per H. Lundow

Status

approved