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.

A033529 Number of matchings in graph P_{2} X P_{6} X P_{n}.

Original entry on oeis.org

1, 733, 4334009, 20324827981, 98618371821449, 476450515130518749, 2303329608950881340608, 11134067093100203643948181, 53821768256990554940684650505, 260172308883754886843036887611589, 1257663186848063684537091601425009561
Offset: 0

Views

Author

Per H. Lundow

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.

Links

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.