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.

A033522 Number of matchings in graph C_{10} X P_{n}.

Original entry on oeis.org

1, 123, 117732, 85579087, 65035723280, 49125060601108, 37140865202938885, 28076586641702173315, 21224865471367565301932, 16045172079162180370051008, 12129530424108426130365136337, 9169456015979482738524196819196, 6931754273289828570289322265111621
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.

Crossrefs

Row 10 of A287428.