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.

A033530 Number of matchings in graph P_{3} X P_{3} X P_{n}.

Original entry on oeis.org

1, 131, 90040, 49793133, 28579431833, 16294017491392, 9303034425177393, 5309783310438438755, 3030852157018381983096, 1729989715204411185894125, 987471788038820650012763705, 563644449821238971691233574464, 321725839534452657823357410831785
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.