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.

A033531 Number of matchings in graph P_{3} X P_{4} X P_{n}.

Original entry on oeis.org

1, 823, 5493583, 28579431833, 154620656140976, 831415352314053207, 4475746196648151844135, 24088698990102061728597981, 129653063594088631745065442153, 697826352881007761016861345617984, 3755891812799886342646421870514820641
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.