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.

A033523 Number of matchings in graph C_{11} X P_{n}.

Original entry on oeis.org

1, 199, 378424, 531616825, 784262868625, 1149284628732204, 1685897303909927649, 2472705159894822329223, 3626792720604314478281516, 5319512204961806610481718127, 7802271843434650931552185647127, 11443801542489979112417158760023324
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 11 of A287428.