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.

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

Original entry on oeis.org

1, 144, 251498, 293066688, 370635224561, 461148537211748, 575975678462394151, 718704019165239462736, 897032469743945346623442, 1119528305492897225312120742, 1397239543795157686038029989037, 1743829823240164494694386437970640
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=11 of A210662.