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.

A033525 Number of matchings in graph C_{13} X P_{n}.

Original entry on oeis.org

1, 521, 3909830, 20515048427, 114049219978023, 629054823210684476, 3473775971752370727131, 19179686041473059942755365, 105899042012449225094998682338, 584710646991236367599977270008305, 3228421282256766290943315048262784813
Offset: 0

Views

Author

Per H. Lundow

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.

Links

Crossrefs

Row 13 of A287428.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.