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.

A033528 Number of matchings in graph P_{2} X P_{5} X P_{n}.

Original entry on oeis.org

1, 228, 305184, 334056618, 376940962215, 423657524608288, 476450515130518749, 535774070372040050788, 602492787376187496898304, 677518242019979197787376936, 761886547661136372157201911987, 856760801962209647160995669509984, 963449325363457811035756544808212891
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.