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.

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

Original entry on oeis.org

1, 76, 36626, 13775700, 5392866995, 2099687534810, 818177759586592, 318778982954630760, 124205035822005824254, 48393567952045732290238, 18855421270525299234217319, 7346573263558160357598269172, 2862420221714879808794571247043
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 9 of A287428.