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.

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

This page as a plain text file.
%I A033534 #8 Dec 09 2013 11:40:15
%S A033534 1,2810694,423657524608288,42127221925485860896792,
%T A033534 4435122353330774501960785797973,
%U A033534 463310369790129032480118384076035223552
%N A033534 Number of matchings in graph P_{5} X P_{5} X P_{n}.
%D A033534 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.
%H A033534 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A033534 nonn
%O A033534 0,2
%A A033534 _Per H. Lundow_