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.

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

This page as a plain text file.
%I A033533 #7 Dec 09 2013 11:39:56
%S A033533 1,10012,1441534384,154620656140976,17312701462385916505,
%T A033533 1926836037115087006553088,214664979834173287380956088153,
%U A033533 23911146651705731250582573707211200
%N A033533 Number of matchings in graph P_{4} X P_{4} X P_{n}.
%D A033533 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 A033533 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A033533 nonn
%O A033533 0,2
%A A033533 _Per H. Lundow_