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.

A033527 Number of matchings in graph P_{2} X P_{4} X P_{n}.

Original entry on oeis.org

1, 71, 21497, 5493583, 1441534384, 376940962215, 98618371821449, 25799240154157639, 6749345823947488233, 1765694380951147363456, 461922949276035424430681, 120843562204869252316712655, 31613858308925485200467329841, 8270494656919429771594190182151
Offset: 0

Views

Author

Keywords

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.