cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A033532 Number of matchings in graph C_{4} X C_{4} X P_{n}.

Original entry on oeis.org

1, 41025, 13803794944, 3952450882750401, 1149377449671217283137, 333818434084936656186187776, 96963347585045688551801772350785, 28164412862777096850129871275625835649, 8180769830636914759269721968659872494731776, 2376225290581931684771439975937521777947501317377
Offset: 0

Views

Author

Keywords

Comments

a(1) = A045310(4), a(2) = A045310(5).

References

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

Extensions

a(8)-a(9) from Alois P. Heinz, Dec 09 2013