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.

A033512 Number of matchings in graph P_{9} X P_{n}.

Original entry on oeis.org

1, 55, 24342, 7594361, 2548684656, 842518533590, 279533139565077, 92657526436631289, 30721240815429999078, 10185111919160666118608, 3376771882017849561260401, 1119528305492897225312120742, 371166848426649070379972358241, 123056076089539426001744759117065
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

Column k=9 of A210662.